【摘要】 本文证明了如下的结果:设G是阶n(≥3)的2连通图,若对G的所有距离为2的顶点u、v,都有d(v)+d(v)≥n-2或|N(u)∩N(v)|≥α,则G是Hamiltonian图,除非G属于二个特殊图类.α表示图G的独立数.更多还原

【Abstract】 In this paper we prove the following result: Let G be a 2-connected graph of order n(n≥ 3). If for all distinct vertices u and v, d(u,v)=2 implies d(u)+d(v)≥n-2 or |N(u)∩N(v)|≥ a, then G is hamiltonian unless G belongs to two special graphs. Where a denoted the point indenpendence number.更多还原