Sharp upper bounds on the second largest eigenvalues of connected graphs
From MaRDI portal
Recommendations
Cites work
- Bounds of eigenvalues of a graph
- Graph partitioning by eigenvectors
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3783047 (Why is no real title available?)
- On the largest \(k\)th eigenvalues of trees
- The second largest eigenvalue of a tree
Cited in
(11)- Sharp bounds for the second-order general connectivity index of hexagonal chains
- Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
- The second largest eigenvalue and vertex-connectivity of regular multigraphs
- Bounds of eigenvalues of a nontrivial bipartite graph.
- scientific article; zbMATH DE number 810358 (Why is no real title available?)
- On the two largest distance eigenvalues of graph powers
- On the eigenvalues of firefly graphs
- A note on \(\lambda_2\) and \(\lambda_n\) of a graph
- On the second largest adjacency eigenvalue of trees with given diameter
- Sharp upper bounds on the second largest signless Laplacian eigenvalues of connected graphs
- On the maximum second eigenvalue of outerplanar graphs
This page was built for publication: Sharp upper bounds on the second largest eigenvalues of connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417583)