1) Edge and Vertex Connectivity
割边/割点
2) edge-vertex-cut fragment
边点割断片
3) edge-vertex-cut end fragment
边点割端片
4) edge-vertex-cut atom
边点割原子
5) edge cut
边割
1.
This paper redefines the incidence matrix of graph,and generalizes the conclusion in the paper,then gets the matrix discriminance about edge cut of undirected graph and digraph.
对以往文献给出的割边的关联矩阵判别法进行了分析,结果表明,按照代宏霞文章《图的割点的矩阵判别的推广》中给出的图G-S的关联矩阵的定义,不能处理某些特殊的图,因此对图G-S的关联矩阵给出新定义,并将上述文献的结论进行了推广,进而得到无向图、有向图的边割的矩阵判别法。
2.
Employing the maximal restricted edge connectivity of undirected binary de Bruijn graph UB(2,n) ,we enumerate its edge cuts and determine the number of edge cuts that have size at most three.
利用无向二元DeBruijn图UB(2 ,n)的极大限制边连通性计算了它的边割数 ,确定了阶至多为 3的边割数 。
6) cut edges
割边
1.
It is proved that if G does not contain (2m-3)d+4 cut edges, then G has a 2d- factor.
设m ,d都是正整数且m≥ 2 ,G是一个 (2md +1 ) -正则图 ,证明了若G不含 (2m - 3 )d +4条割边 ,则G有一个 2d -因子 ,进而说明上述结果是最好
2.
It is proved that if G does not contain d+4 cut edges,then G has a 2d factor.
证明了若图G不含d +4条割边 ,则G有2d 因子 。
3.
It is proved that if G does not contain (2m-3)d + 4 cut edges, then G has a 2d - factor.
本文在第一和第二章主要证明了以下结论: (Ⅰ) 设m、d都是正整数,且m≥2,G是一个(2md+1)-IE则图,证明了若G不含(2m-3)d+4条割边,则G有一个2d-因子,进而说明上述结果是最好的。
补充资料：割断
截断；切断：～绳索◇历史无法～。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条