Some new sufficient conditions and Hamiltonian connected graphs

摘要：

In 2005, Rahman and Kaykobad introduced the Rahman-Kaykobad condition for the research of Hamiltonian path graphs and proved that if G is a 2-connected graph with n vertices and d(u)+d(y)+δ (u,v)>n+ for each pair of distinct non-adjacent vertices u,v in G, then G has a Hamiltonian path.In 2006 Li proved that if G is a 3connected graph with n vertices and d(u)+d(v)+δ(u,v)>n+3 for each pair of distinct non-adjacent vertices u,v in G, then G is Hamiltonianconnected graphs.In this present paper, we consider some better conditions for the research of Hamiltonian-connected graphs and prove that if G is a 2-connected graph with n vertices and d(u)+d(v) +δ(u,v)>n+2 for each pair of distinct non-adjacent vertices u,v in G, then G is Hamiltonian-connected graphs or G belongs to a class of well-structured graphs.

关键词： Hamiltonian-connected graphs Hamiltonian path graphs Rahman-Kaykobad condition

作者: Kewen Zhao Deqin Chen Yue Lin Zu Li Keyang Zeng

作者单位: Institute of Information Science and Mathematics,Qiongzhou University,Sanya,Hainan,572022,P.R.China Department of Mathematics,Qiongzhou University,Sanya,Hainan,572022,P.R.China Institute of Information Science and Mathematics,Qiongzhou University,Sanya,Hainan,572022,P.R.China

会议类型: 国际会议

会议名称: International Conference on Advances in Engineering 2011(2011年工程研究进展国际学术会议 ICAE2011)

会议地点: 南京

会议语种:英文

页码: 278-281

在线出版日期: 2011-12-17（万方平台首次上网日期，不代表论文的发表时间）