Abstract
A large family of explicit k-regular Cayley graphs X is presented. These graphs satisfy a number of extremal combinatorial properties. (i) For eigenvalues λ of X either λ=±k or |λ|≦2 √k-1. This property is optimal and leads to the best known explicit expander graphs. (ii) The girth of X is asymptotically ≧4/3 logk-1 |X| which gives larger girth than was previously known by explicit or non-explicit constructions.
Original language | English (US) |
---|---|
Pages (from-to) | 261-277 |
Number of pages | 17 |
Journal | Combinatorica |
Volume | 8 |
Issue number | 3 |
DOIs | |
State | Published - Sep 1988 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Discrete Mathematics and Combinatorics
Keywords
- AMS subject classification (1980): 05C35