| 完全图K2n＋1的n个H圈的分解方法 |
| |
| 引用本文： | 侴万禧,雷小磊.完全图K2n＋1的n个H圈的分解方法[J].山西师范大学学报,2009,23(1):8-11. |
| |
| 作者姓名： | 侴万禧 雷小磊 |
| |
| 作者单位： | 安徽理工大学土木建筑学院,安徽,淮南,232001
|
| |
| 摘 要： | 提出了完全图K2n＋1分解成n个边不相交的H圈的两种方法．阐明了完全图K2n＋1的2因子分解的基本思路．介绍了完全图K17的H圈分解的全过程．
|
| 关 键 词： | 完全图 H圈 因子分解 圈着色 边矩阵 |
Methods of Decomposing a Complete Graph K_(2n+1) into n Edge Disjoint Hamiltonian Cycles |
| |
| CHOU Wan-xi,LEI Xiao-lei.Methods of Decomposing a Complete Graph K_(2n+1) into n Edge Disjoint Hamiltonian Cycles[J].Journal of Shanxi Teachers University,2009,23(1):8-11. |
| |
| Authors: | CHOU Wan-xi LEI Xiao-lei |
| |
| Institution: | School of Civil Engineering;Anhui University of Science and Technology;Huainan;Anhui 232001;China |
| |
| Abstract: | Two methods of decomposing a complete graph K2n+1 into n edge disjoint Hamiltonian cycles are proposed.The basic concept of decomposing a complete graph K2n+1 into 2-factors is described.The entire procedure of decomposing a complete graph K17 into Hamiltonian cycles is presented. |
| |
| Keywords: | complete graph Hamiltonian cycle factorization cycle colouring edge matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
