| 关于完全多部图Kn(t)的{C3,C4,C5}-强制分解 |
| |
| 引用本文： | 赵彤.关于完全多部图Kn(t)的{C3,C4,C5}-强制分解[J].信阳师范学院学报(自然科学版),2004,17(4):389-391. |
| |
| 作者姓名： | 赵彤 |
| |
| 作者单位： | 南通航运职业技术学院,基础部,江苏,南通,226006 |
| |
| 摘 要： | Kn(t)的{Ci，Cj,Ck}-强制分解是指将Kn(t)分解为长为i或j或k的圈，并且分解中至少有一个长为i．j和k的圈．本文证明了多部图Kn(t)的{C3，C4，C5)-强制分解存在的必要条件也是充分的。
|
| 关 键 词： | 完全多部图 圈 分解 强制分解 |
| 文章编号： | 1003-0972(2004)04-0389-03 |
Mandatory decomposition of complete multipartite graph into cycles of lengths 3,4 and 5 |
| |
| ZHAO Tong.Mandatory decomposition of complete multipartite graph into cycles of lengths 3,4 and 5[J].Journal of Xinyang Teachers College(Natural Science Edition),2004,17(4):389-391. |
| |
| Authors: | ZHAO Tong |
| |
| Abstract: | A {C_i,C_j,C_k}-mandatory decomposition of K_n(t) is a decomposition of K_n(t) into cycles of lengths i,j,or k such that there are at least one cycle of lengths i,j,and k in the decomposition. In this paper, it is proved that the necessary conditions for the existence of a {C_3,C_4,C_5}-mandatory decomposition of K_n(t) are also sufficient. |
| |
| Keywords: | complete multipartite graph cycle decompisition mandatory decomposition |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
