【摘要】 n阶简单图G,满足e∈E(G),e=uv,使得d(u)+d(v)≥n,在这篇文章里我们证明了图G的周长可以用图G的某些参数表示出来;并且当图G不是完全二部图时,证明了图G包含了长度为3到周长的所有圈.更多还原

【Abstract】 Let G be a simple graph of order n satisfying for every edge uv of G.We show that the circumference of G can be expressed in terms of a certain graph parameter.Moreover,we show that G contains cycles of every length between 3 and the circumference,unless G is complete bipartite.更多还原