Bounds for the extreme eigenvalues of the Laplacian and signless Laplacian of a graph
From MaRDI portal
Publication:690608
DOI10.1007/S10958-012-0788-1zbMATH Open1254.05105OpenAlexW2003520920MaRDI QIDQ690608FDOQ690608
Authors: L. Yu Kolotilina
Publication date: 28 November 2012
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-012-0788-1
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
- The Laplacian Spectrum of a Graph II
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- On the spectral radius of graphs
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Chromatic number and spectral radius
- On sum of powers of the Laplacian eigenvalues of graphs
- A note on sum of powers of the Laplacian eigenvalues of bipartite graphs
Cited In (5)
- Extremal Graph Realizations and Graph Laplacian Eigenvalues
- 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
- Bounds on signless Laplacian eigenvalues of Hamiltonian graphs
- Title not available (Why is that?)
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)