The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree

DOI10.1016/J.DAM.2013.10.028zbMath1284.05065OpenAlexW2074810863MaRDI QIDQ2440128

Hao Li, Weihua Yang, Xiaofeng Guo, Hengzhe Li, Yingzhi Tian

Publication date: 27 March 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.028

zbMATH Keywords

edge-connectivityextremal graph theoryrestricted edge connectivityedge-degreeminimum restricted edge connected graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Minimally restricted edge connected graphs
• On computing a conditional edge-connectivity of a graph
• On k-minimally n-edge-connected graphs
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• On Minimum Critically n-Edge-Connected Graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree