On the first two eigenvalues of regular graphs
From MaRDI portal
Recommendations
Cites work
- Cliques and the spectral radius
- Eigenvalues and triangles in graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Proof of a conjectured lower bound on the chromatic number of a graph
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral bounds for the clique and independence numbers of graphs
- Walks and the spectral radius of graphs
Cited in
(11)- Two conjectured strengthenings of Turán's theorem
- A Brualdi-Hoffman-Turán problem on cycles
- Local properties of the spectral radius and Perron vector in graphs
- Maximal spectral radius of minimally k-(edge)-connected graphs
- A spectral Erdős-Faudree-Rousseau theorem
- Bollobás-Nikiforov conjecture for graphs with not so many triangles
- Spectral supersaturation: triangles and bowties
- A refinement on spectral Mantel's theorem
- Spectral extremal graphs for fan graphs
- A note on the Bollobás-Nikiforov conjecture
- More on Nosal's spectral theorem: books and 4-cycles
This page was built for publication: On the first two eigenvalues of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154412)