| 最小度不小于3的[s,t]-图的可迹性 |
| |
| 引用本文： | 王文彬,王江鲁. 最小度不小于3的[s,t]-图的可迹性[J]. 山东科学, 2009, 22(6): 6-8 |
| |
| 作者姓名： | 王文彬 王江鲁 |
| |
| 作者单位： | 山东师范大学数学科学学院,山东济南,250014 |
| |
| 摘 要： | 如果G中任意s个点的导出子图中至少有t条边,则称G为[s,t]-图.本文证明了：若G为最小度不小于3的2-连通[6,3]-图,则G有Hamilton路或G同构于K5∨G3.
|
| 关 键 词： | [s t]-图 最小度 Hamilton路 |
The Traceability of a [s ,t]-Graph of Minimum Degree No Less than 3 |
| |
| WANG Wen-bin,WANG Jiang-lu. The Traceability of a [s ,t]-Graph of Minimum Degree No Less than 3[J]. Shandong Science, 2009, 22(6): 6-8 |
| |
| Authors: | WANG Wen-bin WANG Jiang-lu |
| |
| Affiliation: | ( School of Mathematics, Sharwlong Normal University, Jinan 250014, China) |
| |
| Abstract: | A graph G is a [s,t]-graph if there are at least t edges in every included sub-graph of any s vertices. This paper proves that a graph G has a Hamilton path or if G is a Hamilton path or G=K5 ∨G3 if G is a δ≥3,2-connected [6,3]-graph. |
| |
| Keywords: | [s |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
