节点文献
图的度和与圈可扩性
Cycle Extensibility and Degree Sums in Graphs
【摘要】 讨论了两个点的度和与圈可扩之间的关系,得到了如下结果:设图G的阶n≥3,如果G中任意一对不同的顶点u,v满足d(u)+d(v)≥n+1,则G是完全圈可扩的。
【Abstract】 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.
- 【文献出处】 科学技术与工程 ,Science Technology and Engineering , 编辑部邮箱 ,2008年18期
- 【分类号】O157.5
- 【被引频次】1
- 【下载频次】25