Skip to main content
Log in

An Isoperimetric Problem in Cayley Graphs

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received April 1996, and in final form February 1999.

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002240000129

Keywords

Navigation