On the edge-connectivity of graphs with two orbits of the same size
From MaRDI portal
Publication:2275399
DOI10.1016/j.disc.2011.04.016zbMath1223.05160OpenAlexW1972254721MaRDI QIDQ2275399
Xiaofeng Guo, László Lipták, Weihua Yang, Zhao Zhang, Eddie Cheng
Publication date: 8 August 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.016
Related Items (2)
On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs ⋮ On the conditional edge connectivity of double-orbit graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Edge-connectivity of regular graphs with two orbits
- Super edge-connectivity of mixed Cayley graph
- On computing a conditional edge-connectivity of a graph
- Super restricted edge-connectivity of vertex-transitive graphs
- Optimally super-edge-connected transitive graphs
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
- Circulants and their connectivities
- Conditional connectivity
- A group-theoretic model for symmetric interconnection networks
- Super edge connectivity properties of connected edge symmetric graphs
- Connectivity of transitive graphs
This page was built for publication: On the edge-connectivity of graphs with two orbits of the same size
