Article (Published version) (297 Kb) - 
Limited access to UNIGEOther version: http://linkinghub.elsevier.com/retrieve/pii/S0095895698918433
Highlights
More informations
Scientific Article
unige:12428 
 |
Not Every Uniform Tree Covers Ramanujan Graphs |
|
| Authors | ||
| Published in | Journal of Combinatorial Theory - Series B. 1998, vol. 74, no. 2, p. 202 - 212 | |
| Abstract | The notion of Ramanujan graph has been extended to not necessarily regular graphs by Y. Greenberg. We construct infinite trees with infinitely many finite quotients, none of which is Ramanujan. We give a sufficient condition for a finite graph to be covered by such a tree. | |
| Keywords | Ramanujan graph — Covering tree — Spectral radius — Mini- mal graph | |
| Identifiers | ||
| Full text |
Article (Published version) (297 Kb) - Limited access to UNIGE Other version: http://linkinghub.elsevier.com/retrieve/pii/S0095895698918433 |
|
| Structures | ||
| Citation (ISO format) | LUBOTZKY, Alexander, SMIRNOVA-NAGNIBEDA, Tatiana. Not Every Uniform Tree Covers Ramanujan Graphs. In: Journal of Combinatorial Theory - Series B, 1998, vol. 74, n° 2, p. 202 - 212. https://archive-ouverte.unige.ch/unige:12428 |
226 hits 
0 download 
Contact an author
Update