Super \(s\)-restricted edge-connectivity of vertex-transitive graphs
From MaRDI portal
Publication:477258
DOI10.1007/S11425-014-4794-2zbMath1303.05103OpenAlexW2270356789MaRDI QIDQ477258
Publication date: 3 December 2014
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-014-4794-2
vertex-transitive graphrestricted edge-connectivity\(s\)-restricted edge-connectivitysuper-\(\lambda\) graph
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- Super cyclically edge connected transitive graphs
- A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- On cyclic edge-connectivity of transitive graphs
- On computing a conditional edge-connectivity of a graph
- Extraconnectivity of graphs with large girth
- Bound on \(m\)-restricted edge connectivity
- Super restricted edge-connectivity of vertex-transitive graphs
- Edge-cuts leaving components of order at least three
- On optimally-\(\lambda^{(3)}\) transitive graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- The Connectivities of a Graph and its Complement
- Connectivity of transitive graphs
This page was built for publication: Super \(s\)-restricted edge-connectivity of vertex-transitive graphs
