| 3-连通[5,2]-图中的Hamilton圈 |
| |
| 引用本文： | 牟磊,王江鲁. 3-连通[5,2]-图中的Hamilton圈[J]. 山东科学, 2010, 23(1): 20-21 |
| |
| 作者姓名： | 牟磊 王江鲁 |
| |
| 作者单位： | 山东师范大学数学科学学院 |
| |
| 摘 要： | 如果图G中任意s个点的导出子图中至少含有t条边,则称图G为[s,t]-图.本文证明了:若G是3-连通[5,2]-图并且|G|≥11,则G含有Hamilton圈.
|
| 关 键 词： | [s t]-图 Hamliton圈 连通 |
The Hamilton Cycle of 3-Connected [5, 2] -Graphs |
| |
| MOU Lei,WANG Jiang-lu. The Hamilton Cycle of 3-Connected [5, 2] -Graphs[J]. Shandong Science, 2010, 23(1): 20-21 |
| |
| Authors: | MOU Lei WANG Jiang-lu |
| |
| Affiliation: | (School of Mathematics, Shandong Normal University, Jinan 250014, China) |
| |
| Abstract: | A graph G is a [s,t] -graph if there are at least t edges in every derived subgraph of any s vertices. This paper proves that a graph G has a Hamilton cycle if G is a 3-connected [5,2] -graph and ｜G｜ ≥11. |
| |
| Keywords: | [ s, t ] -graph Hamilton cycle connectivity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《山东科学》浏览原始摘要信息 |
|
点击此处可从《山东科学》下载全文 |
|
