On the super (edge)-connectivity of generalized Johnson graphs
From MaRDI portal
Publication:6569898
DOI10.1142/s012905412350017xzbMATH Open1543.05099MaRDI QIDQ6569898
Chuanye Zheng, Xuemin Wu, Li Qiong Xu, Zhecheng Yu
Publication date: 9 July 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
cyclic edge-connectivitysuper restricted edge-connectivitygeneralized Johnson graphssuper vertex (edge)-connectedvertex (edge)-transitivity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Super restricted edge connectivity of regular edge-transitive graphs
- On super restricted edge-connectivity of edge-transitive graphs
- On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs
- Hamiltonian uniform subset graphs
- On computing a conditional edge-connectivity of a graph
- Super-connectivity and super-edge-connectivity for some interconnection networks
- The super-connectivity of Kneser graphs
- Connectivity of vertex and edge transitive graphs
- The cyclic edge-connectivity of strongly regular graphs
- The \(p\)-restricted edge-connectivity of Kneser graphs
- Super-cyclically edge-connected regular graphs
- On the girth and diameter of generalized Johnson graphs
- On the diameter of Kneser graphs
- Symmetric Property and Reliability of Balanced Hypercube
- Circulants and their connectivities
- Conditional connectivity
- Super edge connectivity properties of connected edge symmetric graphs
- The super-connectivity of Kneser graph KG(n,3)
- Atoms of cyclic edge connectivity in regular graphs
This page was built for publication: On the super (edge)-connectivity of generalized Johnson graphs