Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
From MaRDI portal
Publication:1025958
DOI10.1016/j.disc.2008.09.051zbMath1182.05075OpenAlexW2055695880MaRDI QIDQ1025958
Publication date: 23 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.051
3-restricted edge connectivityoptimally 3-restricted edge connectedsuper-3-restricted edge connected
Related Items (7)
Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Bounds for the Super Extra Edge Connectivity of Graphs ⋮ The \(k\)-restricted edge connectivity of balanced bipartite graphs ⋮ Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs ⋮ Vulnerability of super extra edge-connected graphs ⋮ Unnamed Item ⋮ Sufficient conditions for triangle-free graphs to be super-$λ'$
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization problems of the third edge-connectivity of graphs
- 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
- Extraconnectivity of graphs with large minimum degree and girth
- Results on the edge-connectivity of graphs
- Cuts leaving components of given minimum order
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- 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
- Sufficient conditions for restricted-edge-connectivity to be optimal
- On optimally-\(\lambda^{(3)}\) transitive graphs
- Upper bound on the third 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 and super‐λ′
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
This page was built for publication: Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
