1) 3-Connccted 3-regular graph
3连通3正则图
2) connected 3-regular graph
3正则连通图
1.
In this paper,we give a method by changing labels to determine the cordiality of the connected 3-regular graphs.
用调整顶点标号的方法确定了3正则连通图的Cordial性。
3) 3-regular connected graph
3-正则连通图
1.
The relation between cyclic edge-connectivity and cyclic connectivity of a 3-regular connected graph G is studied.
研究了一般3-正则连通图G的环边连通性和环连通性之间的关系,证明了G的环边连通度等于其环连通度。
4) 3-regular graph
3-正则图
1.
1-factor and the number of cut-edges in 3-regular graph;
3-正则图的1-因子与割边数
5) 3-connected grpah
3-连通图
6) connected graph
3连通图
1.
Removable edges in a spanning tree of a 3-connected graph;
3连通图生成树上的可去边
2.
An edge of 3 connected graph G is said to be removable if G e is subdivision of a 3 connected graph.
设 e是 3连通图 G的一条边 ,如果 G- e是某个 3连通图的剖分 ,则称 e是 G的可去边 。
补充资料：无正
1.谓没有正确的。 2.无人评正是非。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条