Results 251 to 260 of about 174,868,130 (283)
Inverse Degree and Edge-Connectivity
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lutz Volkmann +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Edge-Rupture Degree of Graphs
Applied Mathematics and Computation, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuefang Sun, Fengwei Li
exaly +3 more sources
Inverse Degree and Super Edge-Connectivity
International Journal of Computer Mathematics, 2012Let G be a connected graph of order n, minimum degree δ(G) and edge connectivity λ(G). The graph G is called maximally edge-connected if λ(G)=δ(G), and super edge-connected if every minimum edge-cut consists of edges incident with a vertex of minimum degree.
Yingzhi Tian, Chengfu Qin, Litao Guo
exaly +2 more sources
Minimum degree, edge-connectivity and radius
Journal of Combinatorial Optimization, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baoyindureng Wu +4 more
openaire +1 more source
Restricted edge connectivity of graphs on degree
Journal of Intelligent & Fuzzy Systems, 2018Let G = ( V , E ) be a connected graph. An edge set S ⊂ E is a 3-restricted edge cut, if G -
Litao Guo, Bernard L. S. Lin
openaire +2 more sources