On the connectivity of \(p\)-diamond-free vertex transitive graphs
From MaRDI portal
Publication:423953
DOI10.1016/j.dam.2011.11.016zbMath1242.05148OpenAlexW2077803656MaRDI QIDQ423953
Zhao Zhang, Yingzhi Tian, Ji Xiang Meng
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.016
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Superconnected and hyperconnected small degree transitive graphs
- On super restricted edge-connectivity of edge-transitive graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Super-connected edge transitive graphs
- Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
- On the connectivity of \(p\)-diamond-free graphs
- The superconnectivity of large digraphs and graphs
- Subsets with small sums in abelian groups. I: The Vosper property
- Connectivity of vertex and edge transitive graphs
- On the connectivity of diamond-free graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Connectivity of transitive graphs
This page was built for publication: On the connectivity of \(p\)-diamond-free vertex transitive graphs