Super-connected edge transitive graphs
From MaRDI portal
Publication:944751
DOI10.1016/J.DAM.2007.09.014zbMATH Open1152.05346OpenAlexW2046707029MaRDI QIDQ944751FDOQ944751
Publication date: 10 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.09.014
Recommendations
Cites Work
- The superconnectivity of large digraphs and graphs
- Connectivity of vertex and edge transitive graphs
- On the extraconnectivity of graphs
- Conditional connectivity
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- On the restricted connectivity and superconnectivity in graphs with given girth
- Connectivity of transitive graphs
- Title not available (Why is that?)
- Subsets with small sums in abelian groups. I: The Vosper property
Cited In (12)
- Super Edge-Connected Linear Hypergraphs
- Semi-hyper-connected vertex transitive graphs
- Reversals Cayley graphs of symmetric groups
- Title not available (Why is that?)
- On the connectivity of \(p\)-diamond-free vertex transitive graphs
- Super-connected arc-transitive digraphs
- Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
- Connectivity of vertex and edge transitive graphs
- Optimally super-edge-connected transitive graphs
- Super-connected but not super edge-connected graphs
- Super-connected and hyper-connected jump graphs
- The existence and upper bound for two types of restricted connectivity
This page was built for publication: Super-connected edge transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944751)
