path extendable
基本解釋
- [數(shù)學(xué)]路可擴(kuò)
專業(yè)釋義
- 路可擴(kuò)
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.
在第四章中,討論了圖中在與度有關(guān)的條件下關(guān)於路的幾個(gè)結(jié)果:定理4.3設(shè)G的堦n≥3,如果G中任意一對(duì)不同的頂點(diǎn)u,ν滿足d(u)+d(ν)≥n+1,則G是路可擴(kuò)的。