Minimally 3-restricted edge connected graphs

DOI10.1016/j.dam.2008.07.009zbMath1173.05337OpenAlexW2026570125MaRDI QIDQ1028461

Yanmei Hong, Qinghai Liu, Zhao Zhang

Publication date: 30 June 2009

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

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

zbMATH Keywords

fault tolerancerestricted edge connectivity

Mathematics Subject Classification ID

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

Related Items (1)

On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks

Cites Work

• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On computing a conditional edge-connectivity of a graph
• Extraconnectivity of graphs with large girth
• On a kind of restricted edge connectivity of graphs
• Edge-cuts leaving components of order at least three
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Optimally super-edge-connected transitive graphs
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• Sufficient conditions for a graph to be λ _k -optimal with given girth and diameter
• Sufficient conditions for λ′‐optimality in graphs with girth g
• On restricted edge-connectivity of graphs.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimally 3-restricted edge connected graphs