On Isoperimetric Connectivity in Vertex-Transitive Graphs

DOI10.1137/S089548019630635XzbMath0951.05051MaRDI QIDQ4943708

Ralph Tindell, Oriol Serra, Yahya Ould Hamidoune, Anna S. Lladó

Publication date: 19 March 2000

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Cayley graphsvertex-transitive graphsarc-transitive graphsisoperimetric connectivity

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

Disconnecting strongly regular graphs ⋮ Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal ⋮ Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs ⋮ Extra edge connectivity and isoperimetric edge connectivity ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ Yahya Ould Hamidoune's mathematical journey: a critical review of his work ⋮ A structure theorem for small sumsets in nonabelian groups ⋮ Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 ⋮ On the isoperimetric number of a \(k\)-degree Cayley graph

This page was built for publication: On Isoperimetric Connectivity in Vertex-Transitive Graphs