Cycle Extensibility and Degree Sums in Graphs
Liu Xu-wen · Science Technology and Engineering · 2008
The relations between degree sums and extending cycles in graphs is studied.The following results are proved.Let G is a graph of order n≥3.If d(u)+d(v)≥n+1 for any distinct vertices u,v in V(G),then G is fully cycle extendable.