Abstract
An approach to find an elementary construction of Ramanujan graphs was discussed. The constructions were based on deep results concerning certain number-theoretic conjectures by Ramanujan. Therefore, such graphs are called Ramanujan. It was found that every graph G of maximal degree d has a signing s with spectral radius.
| Original language | English |
|---|---|
| Pages (from-to) | 911-912 |
| Number of pages | 2 |
| Journal | Combinatorics Probability and Computing |
| Volume | 13 |
| Issue number | 6 |
| DOIs | |
| State | Published - Nov 2004 |