Hamilton连通图的一个充分条件

摘要

Let G be a 3-connected graph with n vertices. The paper proves that if for each pair of vertices u and v of G, d(u,v)=2, has |N(u)∩N(v)|≤α(α is the minimum independent set number), and then max{d(u),d(v)}≥(n+1)/(2), then G is a Hamilton connected graph.