期刊文献+

m<50时完全二部图K_(n,n)的循环m-圈分解

Cyclic M-cycle Decompositions of the Complete Bipartite Graphs K_(n,n) for m<50
下载PDF
导出
摘要 设Kn,n表示每部分具有n个顶点的完全二部图,本文利用差集的方法来构造Kn,n的循环m-圈分解,讨论了30<m<50时的所有整数的循环m-圈分解的存在性,并最终给出了当m<50时,Kn,n存在循环m-圈分解的充分必要条件. Let K denote the complete bipartite graph with n vertices in each part. In this paper, we frist discuss the existence of cyclic m-cycle systems of K in all integers 30 〈 m 〈 50 . Then, the necessary and sufficient conditions are determined for the existence of cyclic m-cycle systems of Kn,n in all integers m 〈 50 .
出处 《河南理工大学学报(自然科学版)》 CAS 2007年第2期217-220,共4页 Journal of Henan Polytechnic University(Natural Science)
基金 河南省自然科学基金资助项目(0611055600)
关键词 循环m-圈分解 差系统 完全二部图 cyclic m-cycle system difference system, the complete bipartite graph type
  • 相关文献

参考文献8

  • 1KOTZIG A.On decompositions of the complete graph into 4k-gons[J].Mat.-Fyz.Cas,1965,15:227-233.
  • 2ROSA A.On cyclic decompositions of the complete graph into (4m+2)-gons[J].Mat.-Fyz.Cas,1966,16:349-352.
  • 3BURATTI M,DELFRA A.Existence of cyclic k-cycle systems of the complete graph[J].Discrete Math,2003,26:113-225.
  • 4BLINCO A,ZANATI S EL,VANDEN EYNDEN C.On the cyclic decomposition of complete graphs into almost-bipartite graphs[J].Discrete Math,2004,284:71-81.
  • 5FU H,WU S.Cyclically decomposing the complete graphs into cycles[J].Discrete Math,2004,282:267-273.
  • 6BURATTI M,DELFRA A.Cyclic hamiltonian cycle systems of the complete graph[J].Discrete Math,2004,279:107-119.
  • 7VIETRI A.Cyclic k-cycle systems of order 2kn+k:a solution of the last open cases[J].Combin.Designs,2004,12:299-310.
  • 8SOTTEAU D.Decomposition of Km,n(Km,m^*into cycles(circuits) of length 2k)[J].Combin.Theory Ser:B,1981,29:75-81.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部