An isoperimetric problem in Cayley graphs

Authors
Hamidoune, YO Llado, AS Serra, O
Citation
Yo. Hamidoune et al., An isoperimetric problem in Cayley graphs, THEOR C SYS, 32(5), 1999, pp. 507-516
Citations number
22
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORY OF COMPUTING SYSTEMS
ISSN journal
14324350 → ACNP
Volume
32
Issue
5
Year of publication
1999
Pages
507 - 516
Database
ISI
SICI code
1432-4350(199909/10)32:5<507:AIPICG>2.0.ZU;2-2
Abstract
Let T be a minimal generating subset of a group G. Let Gamma be the Cayley graph defined on G by S = T boolean OR T-1. Let d(2) be the minimal cardina lity 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.