割边

非主割边与次连通性在寻求欧拉路中的应用

The Application of Non-principal Cut-edge and Secondary Connectivity is Seeking Euler 's Paths

具有k条割边的图的谱半径的界。

Study the bounds of the spectral of the graphs with k edge - cut .

证明了若图G不含d+4条割边，则G有2d因子。

It is proved that if G does not contain d + 4 cut edges , then G has a 2d factor .

一个面所关联的边的个数（割边要计算两次），被称为面的度，用r（f）表示。

The degree of a face f in G ( written r ( f )) is the number of edges of G incident with f , each cut edges counting as two edges .

Alspach和Zhang[2]证明了所有不含Petersen图的剖分子图的无割边图满足圈双覆盖猜想。

Alspach and Zhang [ 2 ] proved that the graphs which do not contain a subdivision of the Petersen graph satisfy cycle double cover conjecture .

在修割边和钻孔之间的裂纹用气弧消除，然后进行焊补。

The crack between the coped and hole was removed by air arc and then repaired by welding .

网络（G，R）的扩张因子是顶点割集和边割集的扩展。

The expanding factors of graphs are the edge and vertex cut set expansion .

限制边割将连通图分离成不含孤立点的不连通图，如果最小限制边割只能分离孤立边，则称图G是超级限制边连通的。

Restricted edge cut separates a connected graph into a disconnected one without isolated vertex . Graph G is super restricted edge connected if no subgraph but an isolated edge can be separated by any minimum restricted edge cut .