1 research outputs found
Double-Star Decomposition of Regular Graphs
A tree containing exactly two non-pendant vertices is called a double-star. A
double-star with degree sequence is denoted by
. We study the edge-decomposition of regular graphs into
double-stars. It was proved that every double-star of size decomposes every
-regular graph. In this paper, we extend this result to -regular
graphs, by showing that every -regular graph containing two disjoint
perfect matchings is decomposed into and , for
all positive integers and such that .Comment: 10 pages, 2 figure