On Double-Star Decomposition of Graphs
A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence (k1 + 1, k2 + 1, 1, . . . , 1) is denoted by Sk1,k2. We study the edge-decomposition of graphs into double-stars. It was proved that every double-star of size k decomposes every 2k-regular...
Main Authors: | Akbari Saieed, Haghi Shahab, Maimani Hamidreza, Seify Abbas |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2017-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1933 |
Similar Items
-
Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
by: Shyu Tay-Woei
Published: (2021-05-01) -
Decomposition of Certain Complete Bipartite Graphs into Prisms
by: Froncek Dalibor
Published: (2017-02-01) -
On Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
by: Abbas Seify
Published: (2018-06-01) -
A characterization of star-perfect graphs
by: G Ravindra, et al.
Published: (2024-03-01) -
The Spectrum Problem for the Connected Cubic Graphs of Order 10
by: Adams Peter, et al.
Published: (2021-11-01)