Sufficient conditions for a graph to be λ k -optimal with given girth and diameter
From MaRDI portal
Publication:3057138
DOI10.1002/net.20322zbMath1205.05132OpenAlexW4236188520MaRDI QIDQ3057138
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20322
Related Items (2)
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected ⋮ Minimally 3-restricted edge connected graphs
Cites Work
- Unnamed Item
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
- On computing a conditional edge-connectivity of a graph
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- Extraconnectivity of graphs with large minimum degree and girth
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- On the extraconnectivity of graphs
- A bound on 4-restricted edge connectivity of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Sufficient conditions for λ′‐optimality in graphs with girth g
This page was built for publication: Sufficient conditions for a graph to be λ k -optimal with given girth and diameter
