Bounds for the extreme eigenvalues of the Laplacian and signless Laplacian of a graph
From MaRDI portal
(Redirected from Publication:690608)
Recommendations
- Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs
- New bounds on the distance Laplacian and distance signless Laplacian spectral radii
- Bounds for eigenvalues of a graph
- Two sharp upper bounds for the signless Laplacian spectral radius of graphs
- New upper bound on the largest Laplacian eigenvalue of graphs
Cites work
- A note on sum of powers of the Laplacian eigenvalues of bipartite graphs
- Chromatic number and spectral radius
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- On sum of powers of the Laplacian eigenvalues of graphs
- On the spectral radius of graphs
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- The Laplacian Spectrum of a Graph II
Cited in
(5)- Bounds on signless Laplacian eigenvalues of Hamiltonian graphs
- Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
- Bounds on the negative eigenvalues of Laplacians on finite metric graphs
- scientific article; zbMATH DE number 6129422 (Why is no real title available?)
- Extremal Graph Realizations and Graph Laplacian Eigenvalues
This page was built for publication: Bounds for the extreme eigenvalues of the Laplacian and signless Laplacian of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690608)