1) (3)edge-panconnected
(3)边-泛连通
2) 3-edge-connected graphs
3-边连通图
1.
In Chapter One, a sufficient condition of 3-edge-connected graphs being collapsible has been discussed by discussing a 4-matching in 3-edge-connected graphs.
第一章通过讨论3-边连通图中的4-匹配得出了3-边连通图中含有可折图的一个充分条件。
3) panconnected graph
泛连通图
4) panconnectivity
泛连通性
1.
We get the following result on panconnectivity of graphs: let G be a connected graph of ordern,if d(u) +d(v) ≥n for all pairs of venices u and v that are at distance two, then the graph G is a [5 n] -panconneded graph if and only if G is a H-Connected graph.
文中证明了关于图的泛连通性的下述结果：设Ｇ为ｎ阶连通图，且对Ｇ中任一对距离为２的顶点ｕ，ｖ，有ｄ（ｕ）＋ｄ（ｖ）≥ｎ，则图Ｇ是［５ｎ］－泛连通的当且仅当Ｇ是Ｈ连通的。
5) panconnected
泛连通
1.
A graph G is Hamiltonian-connected if every pair of distinct vertices u and vare joined by a Hamiltonian path,and panconnected if u and v are joined by paths of alllengths q,for d(u,v)≤q≤n-1(where d(u,v)is the distance between u and v,and n is theorder of G).
如果图Ｇ的每对不同顶点ｕ和ｖ之间都有哈密顿路相连，则称Ｇ是哈密顿连通的；而如果对于所有满足条件以ｄ（ｕ，ｖ）≤ｑ≤ｎ－１的整数ｑ，ｕ和ｖ之间有长为ｑ路相连，则和Ｇ是泛连通的，其中以ｄ（ｕ，ｖ）是ｕ和ｖ间的距离，而ｎ是Ｇ的顶点数。
6) [a b]-panconnectivity
[ab]-泛连通
补充资料：泛下
1.亦作"泛下"。 2.低下。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条