The second eigenvalue of regular graphs of given girth
From MaRDI portal
Publication:757426
DOI10.1016/0095-8956(92)90020-XzbMath0723.05084MaRDI QIDQ757426
Publication date: 1991
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
orthogonal polynomialsregular graphsprobability distributionshomogeneous treegiven girthsubdominant eigenvalue
Related Items (7)
Finite fields and Ramanujan graphs ⋮ A survey of graph laplacians ⋮ Unnamed Item ⋮ Expander graphs -- both local and global ⋮ A connection between a question of Bermond and Bollobás and Ramanujan graphs ⋮ Approximate Moore graphs are good expanders ⋮ A continuous analogue of the girth problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit construction of regular graphs without small cycles
- Walk generating functions and spectral measures of infinite graphs
- Ramanujan graphs
- Eigenvalues and expanders
- The expected eigenvalue distribution of a large regular graph
- Diameter, covering index, covering radius and eigenvalues
- On the second eigenvalue and random walks in random \(d\)-regular graphs
- A limit law on the distance distribution of binary codes
- Diameters and Eigenvalues
This page was built for publication: The second eigenvalue of regular graphs of given girth