The second eigenvalue of regular graphs of given girth
From MaRDI portal
DOI10.1016/0095-8956(92)90020-XzbMATH Open0723.05084MaRDI QIDQ757426FDOQ757426
Authors: Patrick Solé 
Publication date: 1991
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Recommendations
orthogonal polynomialsprobability distributionsregular graphshomogeneous treegiven girthsubdominant eigenvalue
Cites Work
- Eigenvalues and expanders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ramanujan graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The expected eigenvalue distribution of a large regular graph
- Diameters and Eigenvalues
- Title not available (Why is that?)
- On the second eigenvalue and random walks in random \(d\)-regular graphs
- Explicit construction of regular graphs without small cycles
- Diameter, covering index, covering radius and eigenvalues
- Walk generating functions and spectral measures of infinite graphs
- A limit law on the distance distribution of binary codes
Cited In (13)
- A continuous analogue of the girth problem
- Spectral moments of regular graphs in terms of subgraph counts
- Expander graphs -- both local and global
- Title not available (Why is that?)
- Approximate Moore graphs are good expanders
- Linear programming bounds for regular graphs
- A connection between a question of Bermond and Bollobás and Ramanujan graphs
- On the spectrum of projective norm-graphs
- Title not available (Why is that?)
- A survey of graph laplacians
- Regular graphs with girth at least 5 and small second largest eigenvalue
- Finite fields and Ramanujan graphs
- On the second eigenvalue and random walks in random \(d\)-regular graphs
This page was built for publication: The second eigenvalue of regular graphs of given girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757426)
