| 3-连通无爪图的最长圈 |
| |
| 引用本文： | 闻良辰.3-连通无爪图的最长圈[J].沈阳航空工业学院学报,2005,22(4):85-87. |
| |
| 作者姓名： | 闻良辰 |
| |
| 作者单位： | 沈阳航空工业学院理学系,辽宁,沈阳,110034 |
| |
| 摘 要： | Hamilton问题是图论中重要的问题之一,已经得到了很多很好的结果,但一个图是Hamilton图的充分必要条件到现在还没有得出,于是开始研究无向图的最长圈,文章应用幅度的概念,使用反证法,通过构造最长圈并得出矛盾的方法,给出了3-连通无爪图最长圈的下限 .
|
| 关 键 词： | 3-连通 无爪图 周长 幅度 Hamilton |
| 文章编号： | 1007-1385(2005)04-0085-03 |
| 修稿时间： | 2005年4月20日 |
Circumference in three-connected claw-free graphs |
| |
| WEN Liang-chen.Circumference in three-connected claw-free graphs[J].Journal of Shenyang Institute of Aeronautical Engineering,2005,22(4):85-87. |
| |
| Authors: | WEN Liang-chen |
| |
| Abstract: | Hamilton problem is one of the most importance problems in Graph Theory, we have got many achievements, but there is no the result of what is the sufficient and necessary condition that a graph is a Hamiltonian graph, so we begin to study the longest cycle in graph. In this paper, we introduce the definition of spoke number, by way of contradiction, we get the lower bound of circumference in 3-connected claw-free graphs by the methods of constructing the longest cycle, it can be shown as . |
| |
| Keywords: | three-connected claw-free graphs circumference spoke number Hamilton |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
