Abstract
We construct an infinite family of (q + 1)-regular Ramanujan graphs X n of girth 1. We also give covering maps Xn+1 → Xn such that the minimal common covering of all the Xn's is the universal covering tree.
Original language | English |
---|---|
Pages (from-to) | 487-502 |
Number of pages | 16 |
Journal | Combinatorica |
Volume | 23 |
Issue number | 3 |
DOIs | |
State | Published - 1 Dec 2003 |
Externally published | Yes |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics