| 完全图Kn的{ P4, S4,C4 }-分解 |
| |
| 引用本文： | 顾成扬. 完全图Kn的{ P4, S4,C4 }-分解[J]. 华侨大学学报(自然科学版), 2005, 26(2): 222-224 |
| |
| 作者姓名： | 顾成扬 |
| |
| 作者单位： | 淮阴师范学院数学系,江苏,淮安,223001 |
| |
| 基金项目： | 江苏省高校自然科学基金资助项目(03KJB110012) |
| |
| 摘 要： | 讨论完全图Kn分解成4个顶点的路、星和圈的存在性．给出完全图Kn存在{C4，S4}，{P4，C4)，{P4，S4}，{P4，S4，C4}-分解以及强制分解的充要条件．
|
| 关 键 词： | 完全图Kn 完全二部图Km n 路Pk 星Sk 圈Ck |
| 文章编号： | 1000-5013(2005)02-0222-03 |
Decomposition of Complete Graph Kn into {P4, S4,C4} |
| |
| Gu Chengyang. Decomposition of Complete Graph Kn into {P4, S4,C4}[J]. Journal of Huaqiao University(Natural Science), 2005, 26(2): 222-224 |
| |
| Authors: | Gu Chengyang |
| |
| Abstract: | Regarding the decomposition of complete graph K_n into four apexes, the author discusses the existence of its path, star and circle; and gives necessary and sufficient conditions for complete graph K_n to have {C_4, S_4},{P_4, C_4}, {P_4, S_4} and {P_4, S_4,C_4} decomposition and coercive decomposition. |
| |
| Keywords: | complete graphs K_n complete bipartite graphs K_(m n) path P_k star S_k cycle C_k |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
