A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)
From MaRDI portal
Publication:977242
DOI10.1007/s11425-009-0179-3zbMath1222.05133OpenAlexW2024117627MaRDI QIDQ977242
Publication date: 21 June 2010
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-009-0179-3
\(\lambda _{m }\)-connected\(\lambda _{m }\)-cut\(m\)-restricted edge-connectivity\(m\)-restricted edge-cut
Related Items (3)
Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Super \(s\)-restricted edge-connectivity of vertex-transitive graphs ⋮ \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
Cites Work
- 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
- On the extraconnectivity of graphs
- A bound on 4-restricted edge connectivity of graphs
- Upper bound on the third edge-connectivity of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Conditional connectivity
This page was built for publication: A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)
