Minimally restricted edge connected graphs
From MaRDI portal
Publication:953882
DOI10.1016/j.aml.2007.09.004zbMath1180.05058OpenAlexW2041440400MaRDI QIDQ953882
Qinghai Liu, Zhao Zhang, Yanmei Hong
Publication date: 6 November 2008
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2007.09.004
Related Items (4)
On edge cut of graphs leaving components of order at least five ⋮ On optimizing edge connectivity of product graphs ⋮ The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree ⋮ Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
Cites Work
- On computing a conditional edge-connectivity of a graph
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Optimally super-edge-connected transitive graphs
- Sufficient conditions for restricted-edge-connectivity to be optimal
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Sufficient conditions for λ′‐optimality in graphs with girth g
- On restricted edge-connectivity of graphs.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Minimally restricted edge connected graphs
