邻集并、连通度及最大度和Hamilton连通性

Neighborhood Union,Connectivity and Maximum Degree for Hamiltonconnected Properties

文章讨论了无爪图的Hamilton连通性 ,给出邻集并与最大度的条件下Hamilton连通图的新的充分条件,证明了下述定理 :设G是一个3 -连通简单无爪图 ,连通度为k。如果对于G的每一个k阶独立集S满足 :对 u,v∈S,都有(1)k>3时,│N(u)∪N(v)│≥n-Δ(s) -k +2,(2)k=3时,│N(u)∪N(v)│≥n -Δ(s),则G是Hamilton连通的。

In this paper,a newsufficient condition for Hamiltonconnected claw-free graphs is given.Some known results beˉcome corollaries of the conclusion.