Decomposition of Complete Graphs into Cycles and Stars

研究成果: 雜誌貢獻文章

19 引文 斯高帕斯(Scopus)

摘要

Let Ck denote a cycle of length k and let Sk denote a star with k edges. As usual Kn denotes the complete graph on n vertices. In this paper we investigate decomposition of Kn into Cl's and Sk's, and give some necessary or sufficient conditions for such a decomposition to exist. In particular, we give a complete solution to the problem in the case l = k = 4 as follows: For any nonnegative integers p and q and any positive integer n, there exists a decomposition of Kn into p copies of C4 and q copies of S4 if and only if 4(p + q) = q ≠ 1 if n is odd, and q ≥{3, n/2}if n is even.

原文英語
頁(從 - 到)301-313
頁數13
期刊Graphs and Combinatorics
29
發行號2
DOIs
出版狀態已發佈 - 2013 一月 1
對外發佈Yes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

指紋 深入研究「Decomposition of Complete Graphs into Cycles and Stars」主題。共同形成了獨特的指紋。

  • 引用此