| 2-连通［4,1］-图的Hamilton圈 |
| |
| 引用本文： | 张伟,王江鲁. 2-连通［4,1］-图的Hamilton圈[J]. 山东科学, 2011, 24(1): 68-71 |
| |
| 作者姓名： | 张伟 王江鲁 |
| |
| 作者单位： | 山东师范大学数学科学学院，山东 济南 250014 |
| |
| 摘 要： | 如果G的任意s个点的导出子图中至少含有t条边，则称图G为［s, t］-图。本文证明了以下结果：2-连通［4,1］-图是Hamilton图的充要条件是它不同构于三类特殊的图。
|
| 关 键 词： | ［s t］-图 Hamilton圈 连通 |
Hamilton cycles of 2-connected [ 4,1 ] -graphs |
| |
| ZHANG Wei,WANG Jiang-Lu. Hamilton cycles of 2-connected [ 4,1 ] -graphs[J]. Shandong Science, 2011, 24(1): 68-71 |
| |
| Authors: | ZHANG Wei 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 included subgraph of s vertices. This paper proves that the sufficient and necessary condition of a 2-connected [ 4,1 ] -graph to be a Hamilton cycle is that it is not isomorphic to three kinds of specific graphs. |
| |
| Keywords: | [ s, t ] -graph Hamilton cycle connectivity |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《山东科学》浏览原始摘要信息 |
|
点击此处可从《山东科学》下载免费的PDF全文 |
|
