Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
From MaRDI portal
Publication:966034
DOI10.1016/j.disc.2009.10.014zbMath1286.05161OpenAlexW2159177351MaRDI QIDQ966034
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.10.014
triangle-free graph\(k\)-restricted edge connectivityrestricted edge connectivity\(\lambda_k\)-optimal graph
Related Items (7)
Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected ⋮ \(k\)-restricted edge-connectivity in triangle-free graphs ⋮ On computing of a conditional edge connectivity of alternating group network ⋮ The \(k\)-restricted edge connectivity of balanced bipartite graphs ⋮ On the complexity of computing the \(k\)-restricted edge-connectivity of a graph ⋮ Sufficient conditions for triangle-free graphs to be super-$λ'$ ⋮ On the Complexity of Computing the k-restricted Edge-connectivity of a Graph
Cites Work
- Unnamed Item
- Unnamed Item
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- On the restricted connectivity and superconnectivity in graphs with given girth
- Some remarks on \(\lambda _{p,q}\)-connectedness
- Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- On computing a conditional edge-connectivity of a graph
- Superconnectivity of bipartite digraphs and graphs
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- 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
- Optimally super-edge-connected transitive 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\)
- Super edge connectivity properties of connected edge symmetric graphs
- 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 \(\lambda _k\)-optimality in triangle-free graphs
