It is shown that if G is a 2 connected graph on n≥10 vertices such that d(x)+d(y)+d(z)≥3n/2-2 for every triple of vertices x,y,z with min {d(x,y),d(y,z),d(x,z)}=2 , then G is pancyclic or ...It is shown that if G is a 2 connected graph on n≥10 vertices such that d(x)+d(y)+d(z)≥3n/2-2 for every triple of vertices x,y,z with min {d(x,y),d(y,z),d(x,z)}=2 , then G is pancyclic or n is even and G= K n/2 ,展开更多
文摘It is shown that if G is a 2 connected graph on n≥10 vertices such that d(x)+d(y)+d(z)≥3n/2-2 for every triple of vertices x,y,z with min {d(x,y),d(y,z),d(x,z)}=2 , then G is pancyclic or n is even and G= K n/2 ,