On Isoperimetric Connectivity in Vertex-Transitive Graphs
From MaRDI portal
Recommendations
Cited in
(12)- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Link fault tolerability of the Cartesian product power graph (K₉ -C₉)^n: conditional edge-connectivities under six link fault patterns
- Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- On the isoperimetric number of a \(k\)-degree Cayley graph
- scientific article; zbMATH DE number 6402649 (Why is no real title available?)
- Yahya Ould Hamidoune's mathematical journey: a critical review of his work
- Disconnecting strongly regular graphs
- A structure theorem for small sumsets in nonabelian groups
- The generalized strong isoperimetric inequality in locally finite networks
- Extra edge connectivity and isoperimetric edge connectivity
This page was built for publication: On Isoperimetric Connectivity in Vertex-Transitive Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943708)