| 哈密尔顿连通的度和与邻域交条件 |
| |
| 引用本文： | 葛仁福. 哈密尔顿连通的度和与邻域交条件[J]. 徐州师范大学学报(自然科学版), 2002, 20(3): 15-18 |
| |
| 作者姓名： | 葛仁福 |
| |
| 作者单位： | 连云港师范专科学校,数学系,江苏,连云港,222006 |
| |
| 摘 要： | Let S^23 denote an independent set with mini dist (u,v)|u, v∈S} = 2 and |S|=3. Our main result is the following theorem: Let G be a 3-connected graph of order n such that d(u) d(v) d(w)≥n 1 |N(u)∩N(v)∩N(w)|for any independent set S^23={u,v,w}, then G is Hamilton-connected.
|
| 关 键 词： | Sum度 邻域交条件 哈密尔顿连通 数学分析 |
Degree Sum and Neighborhood Intersections for Hamilton-connection |
| |
| GERen-fu. Degree Sum and Neighborhood Intersections for Hamilton-connection[J]. Journal of Xuzhou Normal University(Natural Science Edition), 2002, 20(3): 15-18 |
| |
| Authors: | GERen-fu |
| |
| Affiliation: | DepartmentofMathematics,LianyungangTeachersCollege,Lianyungang,222006,China |
| |
| Abstract: | Let S23 denote an independent set with min{dist(u,v)|u,v∈S}=2 and |S|=3.Our main result is the following theorem: Let G be a 3-connected graph of order n such that d(u)+d(v)+d(w)≥n+1+|N(u)∩N(v)∩N(w)|for any independent set S23 ={u,v,w},then G is Hamilton-connected. |
| |
| Keywords: | degree neighborhood Hamilton connection |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
