图的度和与扩圈.pdfVIP

Pure Mathematics 理论数学, 2011, 1, 64-67 doi:10.4236/pm.2011.12014 Published Online July 2011 (/journal/pm/) Extending Cycles and Degree Sums in Graphs Jianglu Wang, Jianmin Cheng School of Mathematical Sciences, Shandong Normal University, Jinan Email: yzhfzh@ Received: Mar. 24th, 2011; revised: May 25th, 2011; accepted: Jun. 1st, 2011. Abstract: In this paper, we study the relations between degree sums and extending cycles in graphs. The fol- lowing result is proved. Let G be a graph of order n 3 . If d u d v n k for each pair of nonadjacent     n vertices u,v in V G , then every cycle C of G with   is extendable. By the result, we have that   C n k 2 3 if d u d v  n 2 for each pair of nonadjacent vertices u, v in V G , then G is fully cycle extend-       2 able. Keywords: Degree of Vertex; Extending Cycle 图的度和与扩圈 王江鲁，程建民 山东师范大学数学科学学院，济南 Email: yzhfzh@ 收稿日期：2011 年 3 月 24 日；修回日期：2011 年 5 月 25 日；录用日期：2011 年 6 月 1 日 摘 要：本文讨论了两顶点的度和与圈可扩之间的关系，得到了如下结果：设图 G 的阶n 3 ，如果 G n 中任意一对不相邻的顶点 u,v 满足d u d v n k ，则 G 中任意一个满足  C n 的圈 C 是可    