Name
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. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1006/jctb.1998.1843 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
uniform tree,minimal graph,spectral radius,ramanujan graph,covering tree,regular graph | Block graph,Discrete mathematics,Combinatorics,Strongly regular graph,Ramanujan's sum,Forbidden graph characterization,Regular graph,Symmetric graph,Universal graph,Mathematics,Ramanujan graph | Journal |
Volume | Issue | ISSN |
74 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Lubotzky | 1 | 231 | 43.47 |
| Tatiana Nagnibeda | 2 | 6 | 2.19 |