edge-connectivity相关论文
An edge-cut of an edge-colored connected graph is called a rainbow cut if no two edges in the edge-cut are colored the s......
It has been shown that a λ m-connected graph G has the property λ m (G)≤ξ m (G) for m≤3.But for m≥4,Bonsma et al.p......
Sufficient Conditions for Maximally Edge-connected and Super-edge-connected Digraphs Depending on th
Let D be a finite and simple digraph with vertex set V(D).The minimum degree δ of a digraph D is defined as the minimum......
为探究吕家坨井田地质构造格局,根据钻孔勘探资料,采用分形理论和趋势面分析方法,研究了井田7......
为探究吕家坨井田地质构造格局,根据钻孔勘探资料,采用分形理论和趋势面分析方法,研究了井田7......
考虑两个平面图,一个染成红色,另一个染成绿色.两个图同时2-胞腔嵌入平面时,在一定的限制条件下,红色的边与绿色的边会相交.称这样的交点......
证明了对于任意的图G,其变换图G^+--是极大边连通的当且仅当G至少有两条边且不同构于2K2.......
图的超级限制边连通性是度量计算机互连网络可靠性(容错性)的一个重要参数.本文通过考虑图的超级限制边连通性,得到如下结论:若G是......
Tian and Meng in [Y. Tian and J. Meng, λc -Optimally half vertex transitive graphs with regularity k, Information Proce......