摘要
Let G be a 2 connected simple graph with order n (n≥6) and minimum degree δ . This paper proves that if for any independent set of three vertices { u,v,w} V(G ) there always exist x and y∈{u,v,w } such that | N(x)∪N(y)|≥n-δ+1 , then G is pancyclic.
