Path decompositions of γKn,n

Tay Woei Shyu*

*此作品的通信作者

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

3 引文 斯高帕斯(Scopus)

摘要

Let Pk denote a path with k vertices and k - 1 edges. And let γKn,n denote the γ-fold complete bipartite graph with both parts of size n. A Pk-decomposition D of γKn,n is a family of subgraphs of γKn,n whose edge sets form a partition of the edge set of XKn-n such that each member of & is isomorphic to Pk. Necessary conditions for the existence of a Pfc-decomposition of γKn,n are (i) γn2 = 0 (mod k-1) and (ii) k ≤ n + 1 if γ = 1 and n is odd, or k ≤ 2n if A ≥ 2 or n is even. In this paper, we show these necessary conditions are sufficient except for the possibility of the case that γ = 3, n = 15, and k = 28.

原文英語
頁(從 - 到)211-219
頁數9
期刊Ars Combinatoria
85
出版狀態已發佈 - 2007 十月 1

ASJC Scopus subject areas

  • 數學(全部)

指紋

深入研究「Path decompositions of γK<sub>n,n</sub>」主題。共同形成了獨特的指紋。

引用此