On the diameter and bisector size of Cayley graphs

DOI10.1007/BF01371728zbMath0778.05038OpenAlexW2002841128MaRDI QIDQ5289272

Marc Baumslag, Fred S. Annexstein

Publication date: 22 August 1993

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01371728

zbMATH Keywords

boundsdiameterCayley graphsbisectors

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Growth in finite simple groups of Lie type ⋮ Diameters of Cayley graphs of Chevalley groups ⋮ Bounds for the diameters of orbital graphs of affine groups ⋮ On small cuts separating an abelian Cayley graph into two equal parts ⋮ Random walks, bisections and gossiping in circulant graphs ⋮ Some problems on Cayley graphs ⋮ Generating abelian groups by addition only ⋮ Bounds on mincut for Cayley graphs over Abelian groups ⋮ Vertex reconstruction in Cayley graphs ⋮ Node bisectors of Cayley graphs ⋮ Asymptotic growth of finite groups

Cites Work

• Unnamed Item
• Small-diameter Cayley graphs for finite simple groups
• Sorting in \(c \log n\) parallel steps
• Ramanujan graphs
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• Explicit constructions of linear-sized superconcentrators
• Limitations on Explicit Constructions of Expanding Graphs
• Group Action Graphs and Parallel Architectures
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• On Group Graphs and Their Fault Tolerance
• Wide-Sense Nonblocking Networks
• A group-theoretic model for symmetric interconnection networks
• The Degree of Polynomial Growth of Finitely Generated Nilpotent Groups