Let G be a k≥2 connected claw-free graph of order n. This paper shows that if N(u)∪N(v)|≥n-δ(G) -k holds for every pair of vertices u

v with d (u

v)2

then G is Hamiltonian.