标题:Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs
作者:Gao, Yunshu; Li, Guojun; Yan, Jin
作者机构:[Gao, Yunshu] Ningxia Univ, Sch Math, Yinchuan 750021, Peoples R China.; [Li, Guojun; Yan, Jin] Shandong Univ, Sch Math, Jinan 250100, Peoples R Chi 更多
通讯作者:Gao, YS
通讯作者地址:[Gao, YS]Ningxia Univ, Sch Math, Yinchuan 750021, Peoples R China.
来源:ARS COMBINATORIA
出版年:2013
卷:109
页码:405-414
关键词:Hamiltonian graphs; Hamiltonian-connected graphs; Degree condition
摘要:Let G = (V (G), E(G)) be a graph and alpha(G) be the independence number of G. For a vertex v is an element of V(G), d(v) and N(v) represent the degree and the neighborhood of v in G, respectively. In this paper, we prove that if G is a k-connected(k >= 2) graph of order n, and if max{d(v) : v is an element of S} >= n/2 for every independent set S of G with vertical bar S vertical bar = k which has two distinct vertices x, y is an element of S satisfying 1 <= vertical bar N(x) boolean AND N(y)vertical bar <= alpha(G) - 2, then either G is hamiltonian or else G belongs to one of a family of exceptional graphs. We also give a similar sufficient condition for Hamiltonian-connected graphs.
收录类别:SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84902132212&partnerID=40&md5=be7a0c697581e9c5b4e9bf35ca16b5fc
TOP