On the assumption that G is a claw free graph of order n(≥3) and connectivity k,it is proved that G is a Hamilton graph if for any distinct vertices u and v in any independent set S of cardinality k+1,|N(v)∪N(V)|≥n-k-Δ(S).