| 关于完全多部图Kn(t)的{C3,C5}-强制分解 |
| |
| 引用本文： | 赵彤.关于完全多部图Kn(t)的{C3,C5}-强制分解[J].苏州科技学院学报(自然科学版),2002,19(1):16-20. |
| |
| 作者姓名： | 赵彤 |
| |
| 作者单位： | 江苏省南通航运职业技术学院,江苏,南通,226006 |
| |
| 摘 要： | 关于完全多部图Kn(t)的Ck 分解 ,已经取得了一系列的研究成果。Kn(t)的 {Ci,Cj} 强制分解则是指Kn(t)分解为长为i或j的圈 ,并且分解中至少各有一个长分别为i和j的圈。本文证明了多部图Kn(t)的 {C3,C5 } 强制分解存在的必要条件也是充分的。
|
| 关 键 词： | 完全多部图 圈 分解 强制分解 |
| 文章编号： | 1004-5201(2002)01-0016-05 |
| 修稿时间： | 2001年8月10日 |
Mandatory Decomposition of Complete Multipartite Graph into Cycles of Lengths 3 and 5 |
| |
| ZHAO Tong.Mandatory Decomposition of Complete Multipartite Graph into Cycles of Lengths 3 and 5[J].Journal of University of Science and Technology of Suzhou,2002,19(1):16-20. |
| |
| Authors: | ZHAO Tong |
| |
| Abstract: | We have already obtained a series of achievements on the decomposition of C k in complete multipartite graph K n(t)up to now. The mandatory decomposition of {C i,C j} in K n(t) is a decomposition of K n(t) into cycles of lengths i or j and there is at least one cycle of lengths i or j in the decomposition. In this paper, it is proved that the necessary conditions for the existence of a mandatory decomposition in {C 3,C 5} of multipartite graph K n(t) are also sufficient. |
| |
| Keywords: | complete multipartite graph decompisition mandatory decomsition |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
