Inverse degree and super edge-connectivity

DOI10.1080/00207160.2012.663491zbMath1257.05076OpenAlexW2108131424MaRDI QIDQ4903572

Yingzhi Tian, Chengfu Qin, Litao Guo, Ji Xiang Meng

Publication date: 22 January 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.663491

zbMATH Keywords

optimizationedge-connectivityinverse degreesuper edge-connectedness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Related Items (3)

Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) ⋮ Super edge-connectivity and zeroth-order Randić index ⋮ Super-edge-connectivity and zeroth-order Randić index

Cites Work

• Unnamed Item
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Inverse degree and edge-connectivity
• Super edge-connectivity of dense digraphs and graphs
• Superconnectivity of bipartite digraphs and graphs
• Results on the edge-connectivity of graphs
• On unreliability polynomials and graph connectivity in reliable network synthesis
• On super-edge-connected digraphs and bipartite digraphs
• A Graph-Theoretic Approach to a Communications Problem
• Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs

This page was built for publication: Inverse degree and super edge-connectivity