On the super (edge)-connectivity of generalized Johnson graphs
From MaRDI portal
Publication:6569898
DOI10.1142/S012905412350017XzbMATH Open1543.05099MaRDI QIDQ6569898FDOQ6569898
Authors: Zhecheng Yu, Liqiong Xu, Xuemin Wu, Chuanye Zheng
Publication date: 9 July 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
cyclic edge-connectivitysuper restricted edge-connectivitygeneralized Johnson graphssuper vertex (edge)-connectedvertex (edge)-transitivity
Cites Work
- Graph theory
- On the diameter of Kneser graphs
- Connectivity of vertex and edge transitive graphs
- Handbook of product graphs
- Circulants and their connectivities
- Conditional connectivity
- Title not available (Why is that?)
- On computing a conditional edge-connectivity of a graph
- Symmetric Property and Reliability of Balanced Hypercube
- Title not available (Why is that?)
- Connectivity of lexicographic product and direct product of graphs.
- Super-connectivity and super-edge-connectivity for some interconnection networks
- Hamiltonian uniform subset graphs
- Super restricted edge connectivity of regular edge-transitive graphs
- On super restricted edge-connectivity of edge-transitive graphs
- Super edge connectivity properties of connected edge symmetric graphs
- The \(p\)-restricted edge-connectivity of Kneser graphs
- On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs
- The cyclic edge-connectivity of strongly regular graphs
- The super-connectivity of Kneser graphs
- On the girth and diameter of generalized Johnson graphs
- Super-cyclically edge-connected regular graphs
- Atoms of cyclic edge connectivity in regular graphs
- The super-connectivity of the Kneser graph \(KG(n,3)\)
This page was built for publication: On the super (edge)-connectivity of generalized Johnson graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569898)