TY - JFULL
AU - Sizhong Zhou
PY - 2009/10/
TI - A Sufficient Condition for Graphs to Have Hamiltonian [a, b]-Factors
T2 - International Journal of Mathematical and Computational Sciences
SP - 703
EP - 706
VL - 3
SN - 1307-6892
UR - https://publications.waset.org/pdf/10536
PU - World Academy of Science, Engineering and Technology
NX - Open Science Index 33, 2009
N2 - Let a and b be nonnegative integers with 2 ≤ a < b, and
let G be a Hamiltonian graph of order n with n ≥ (a+b−4)(a+b−2)
b−2 .
An [a, b]-factor F of G is called a Hamiltonian [a, b]-factor if F
contains a Hamiltonian cycle. In this paper, it is proved that G has a
Hamiltonian [a, b]-factor if |NG(X)| > (a−1)n+|X|−1
a+b−3 for every nonempty
independent subset X of V (G) and δ(G) > (a−1)n+a+b−4
a+b−3 .
ER -