| 无爪图中子图的度和与Hamilton圈 |
| |
| 引用本文： | 马修山,王江鲁. 无爪图中子图的度和与Hamilton圈[J]. 山东师范大学学报(自然科学版), 2012, 27(4): 8-9,12 |
| |
| 作者姓名： | 马修山 王江鲁 |
| |
| 作者单位： | 山东师范大学数学科学学院,250014,济南 |
| |
| 摘 要： | 定义了子图的度的概念，证明了如下结果：设图G是n阶2-连通无爪图，如果G中任意两个同构于心的不相邻子图日，也的度和d（H1）＋d（H2）≥n-2，则G有Hamilton圈．
|
| 关 键 词： | 无爪图 子图的度 Hamihon圈 |
DEGREE SUM OF SUBGRAPH AND HAMILTON CYCLE IN CLAW-FREE GRAPHS |
| |
| Ma Xiushan , Wang Jianglu. DEGREE SUM OF SUBGRAPH AND HAMILTON CYCLE IN CLAW-FREE GRAPHS[J]. Journal of Shandong Normal University(Natural Science), 2012, 27(4): 8-9,12 |
| |
| Authors: | Ma Xiushan Wang Jianglu |
| |
| Affiliation: | Ma Xiushan Wang Jianglu ( School of Mathematics Science, Shandong Normal University ,250014, Jinan, China ) |
| |
| Abstract: | We give the definition of the degree of the subgraph. Our main result is as follows ： If G is a 2 -connected claw- free graph of order n and d（H1）＋d（H2）≥n-2 for every pair of non - adjacent subgraphs H1and H2 isomorphic to/（2, then G has a Hamilton cycle. |
| |
| Keywords: | claw - free graph degree of subgraph Hamilton cycle |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
