In the fourth chapter,we mainly study paths of all graphs about degree conditions and give the following results:Theorem4.3 Let G be a graph of order n≥3. If d（u）+d（v）≥n+1 for every pair u,v,then G is path extendable.
在第四章中,讨论了图中在与度有关的条件下关于路的几个结果:定理4.3设G的阶n≥3,如果G中任意一对不同的顶点u,ν满足d（u）+d（ν）≥n+1,则G是路可扩的。
参考来源 - 图中强路圈性质的若干充分条件·2,447,543篇论文数据，部分数据来源于NoteExpress
应用推荐