1) degree of vertex extending cycle connected graphs
顶点的度完全圈可扩图连通图
2) graph vertax connectivity
图的顶点连通度
3) fully cycle extendable graph
完全圈可扩图
4) fully cycle extendable
完全圈可扩的
1.
In this paper it is shown that every strong quasi-claw-free graph of order n≥3 is fully cycle extendable .
证明了连通局部连通的强半无爪图是完全圈可扩的。
5) totally disconnected graph
完全不连通图
6) fully cycle extendable
完全圈可扩
1.
In this paper,we prove the following result:(i) A connected,locally connected quasi-claw-free graph of order n≥3 is fully cycle extendable;(ii) if G2 is connected quasi-claw-free graph of order n≥3,then G2 is fully cycle extendable.
证明如下结论:(i)顶点数n≥3的连通、局部连通的拟无爪图是完全圈可扩的;(ii)若G2是顶点数n≥3的连通的拟无爪图,则G2是完全圈可扩的。
补充资料：图度
1.揣测;揣度。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条