【摘要】 设G是具有围长g≥5,最小度δ≥2的n阶连通图,若λ=min{d(u)+d(v)|u,v∈V(G),uv■E(G)},则G的周长为:■更多还原

【Abstract】 Let G be a connected graph with n vertices and girth g≥5.If λ=min{d(u)+d(v)|u,v∈V(G),uv■(G)},then,circumference of G:■更多还原