| 子图的度和与Hamilton圈 |
| |
| 引用本文： | 徐珊珊,王江鲁.子图的度和与Hamilton圈[J].山东师范大学学报(自然科学版),2012,27(4):13-14. |
| |
| 作者姓名： | 徐珊珊 王江鲁 |
| |
| 作者单位： | 山东师范大学数学科学学院,250014,济南 |
| |
| 摘 要： | 摘要对图G的一条边w，它的度记为d（uv）：tN（u）uN（v）＼{u，v}．笔者证明了对一个n阶2一连通图G，如果对任意两条不相邻Ⅻ和xy有d（w）＋d（xy）≥n-2，则G有Hamilton圈或Dominating圈．
|
| 关 键 词： | 2-连通图 不相邻子图 Hamilton圈 Dominating圈 |
DEGREE SUM OF SUBGRAPHS AND HAMILTONIAN CYCLE |
| |
| Xu Shanshan
,
Wang Jianglu.DEGREE SUM OF SUBGRAPHS AND HAMILTONIAN CYCLE[J].Journal of Shandong Normal University(Natural Science),2012,27(4):13-14. |
| |
| Authors: | Xu Shanshan Wang Jianglu |
| |
| Institution: | Xu Shanshan Wang Jianglu ( School of Mathematics Science, Shandong Normal University,250014 ,Jinan China ) |
| |
| Abstract: | Let uv be an edge of a graph, its degree d（uv）：tN（u）uN（v）／{u,v}It is proved that a 2 -connected graph G has a Hamilton cycle or a Dominating cycle if for any two non - adjacent edges uv and xy, wehave d（w）＋d（xy）≥n-2 |
| |
| Keywords: | two-connected graph non-adjacent subgraph Hamilton cycle Dominting cycle |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
