Hamilton连通图的一个充分条件

数学季刊 ›› 2003, Vol. 18 ›› Issue (1): 99-102.

Hamilton连通图的一个充分条件

1.Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China; 2.Department of Mathematics and Physics, Huainan Technology Institute, Huainan 232001, China

收稿日期:2001-06-11 出版日期:2003-03-30 发布日期:2024-04-24
作者简介:YIN Zhi-xiang（1966－）,male ,native of Huainan ,Anhui ,an associate professor of Huainan Technology Insti- tute ,Ph．D．,engages in graph theory ,DNA computing ect . .

A Sufficient Condition of Hamilton Connected Graph

1.Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China; 2.Department of Mathematics and Physics, Huainan Technology Institute, Huainan 232001, China

Received:2001-06-11 Online:2003-03-30 Published:2024-04-24
About author:YIN Zhi-xiang（1966－）,male ,native of Huainan ,Anhui ,an associate professor of Huainan Technology Insti- tute ,Ph．D．,engages in graph theory ,DNA computing ect . .

摘要/Abstract

摘要： Let G be a 3-connected graph with n vertices．The paper proves that if for each pair of verti- ces u and v of G ,d（ u ,v ）＝ 2,has | N（ u）∩ N（ v ）|≤ α( αis the minimum independent set num -
ber）,and then max｛d（ u）, ,then G is a Hamilton connected graph .

关键词: degree, connected graph, independent set

Abstract: Let G be a 3-connected graph with n vertices．The paper proves that if for each pair of verti- ces u and v of G ,d（ u ,v ）＝ 2,has | N（ u）∩ N（ v ）|≤ α( αis the minimum independent set num -
ber）,and then max｛d（ u）, ,then G is a Hamilton connected graph .

Key words: degree, connected graph, independent set

中图分类号:

O517．5

殷志祥, 白玫. Hamilton连通图的一个充分条件[J]. 数学季刊, 2003, 18(1): 99-102.

YIN Zhi-xiang , BAI Mei. A Sufficient Condition of Hamilton Connected Graph[J]. Chinese Quarterly Journal of Mathematics, 2003, 18(1): 99-102.