Abstract.
Let T be a minimal generating subset of a group G . Let Γ be the Cayley graph defined on G by \(S=T\cup T^{-1}\) . Let d 2 be the minimal cardinality of the boundary of two points. We show that, for |S|>4 , every cutset with cardinality less than d 2 must isolate a single vertex.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received April 1996, and in final form February 1999.
Rights and permissions
About this article
Cite this article
Hamidoune, Y., Lladó, A. & Serra, O. An Isoperimetric Problem in Cayley Graphs . Theory Comput. Systems 32, 507–516 (1999). https://doi.org/10.1007/s002240000129
Issue Date:
DOI: https://doi.org/10.1007/s002240000129