For a simple graph G of order n greater than or equal to 3, define theta(G) = min{(d(A,($) over bar A))/\($) over bar A\; empty-set not equal A subset of V). We shall prove the following Chvatal-Erdos type condition: If alpha(G) less than or equal to beta(G)n, then G is Hamiltonian. (C) 1994 John Wiley & Sons, Inc.
机构:
Chongqing Technol & Business Univ, Fac Math & Stat, Chongqing 400067, Peoples R ChinaChongqing Technol & Business Univ, Fac Math & Stat, Chongqing 400067, Peoples R China
Lei, Lan
Li, Xiaomin
论文数: 0引用数: 0
h-index: 0
机构:
Chongqing Technol & Business Univ, Fac Math & Stat, Chongqing 400067, Peoples R ChinaChongqing Technol & Business Univ, Fac Math & Stat, Chongqing 400067, Peoples R China
Li, Xiaomin
Ma, Xiaoling
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R ChinaChongqing Technol & Business Univ, Fac Math & Stat, Chongqing 400067, Peoples R China
Ma, Xiaoling
Zhan, Mingquan
论文数: 0引用数: 0
h-index: 0
机构:
Millersville Univ Pennsylvania, Dept Math, Millersville, PA 17551 USAChongqing Technol & Business Univ, Fac Math & Stat, Chongqing 400067, Peoples R China
Zhan, Mingquan
Lai, Hong-Jian
论文数: 0引用数: 0
h-index: 0
机构:
West Virginia Univ, Dept Math, Morgantown, WV 26506 USAChongqing Technol & Business Univ, Fac Math & Stat, Chongqing 400067, Peoples R China