Decomposition of complete bipartite graphs into paths and stars with same number of edges

Tay Woei Shyu*

*此作品的通信作者

    研究成果: 雜誌貢獻期刊論文同行評審

    17 引文 斯高帕斯(Scopus)

    摘要

    In this paper, we give some necessary and sufficient conditions for decomposing the complete bipartite graph Km, n into paths P k+1 and stars Sk+1 with k edges each. In particular, we find necessary and sufficient conditions for accomplishing this when m > k and n ≥ 3k, and we give a complete solution when k = 3. We also apply the results to show that for nonnegative integers p and q and positive integers n and k with n ≥ 4k, there exists a decomposition of the complete graph Kn into p copies of Pk+1 and q copies of Sk+ 1 if and only if k(p + q) = (n2).

    原文英語
    頁(從 - 到)865-871
    頁數7
    期刊Discrete Mathematics
    313
    發行號7
    DOIs
    出版狀態已發佈 - 2013 4月 6

    ASJC Scopus subject areas

    • 理論電腦科學
    • 離散數學和組合

    指紋

    深入研究「Decomposition of complete bipartite graphs into paths and stars with same number of edges」主題。共同形成了獨特的指紋。

    引用此