On the super (edge)-connectivity of generalized Johnson graphs
From MaRDI portal
Publication:6569898
Recommendations
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3390789 (Why is no real title available?)
- Atoms of cyclic edge connectivity in regular graphs
- Circulants and their connectivities
- Conditional connectivity
- Connectivity of lexicographic product and direct product of graphs.
- Connectivity of vertex and edge transitive graphs
- Graph theory
- Hamiltonian uniform subset graphs
- Handbook of product graphs
- On computing a conditional edge-connectivity of a graph
- On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs
- On super restricted edge-connectivity of edge-transitive graphs
- On the diameter of Kneser graphs
- On the girth and diameter of generalized Johnson graphs
- Super edge connectivity properties of connected edge symmetric graphs
- Super restricted edge connectivity of regular edge-transitive graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
- Super-cyclically edge-connected regular graphs
- Symmetric Property and Reliability of Balanced Hypercube
- The \(p\)-restricted edge-connectivity of Kneser graphs
- The cyclic edge-connectivity of strongly regular graphs
- The super-connectivity of Kneser 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)