Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
From MaRDI portal
Publication:984856
DOI10.1016/j.laa.2010.04.026zbMath1215.05100MaRDI QIDQ984856
Publication date: 20 July 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.04.026
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Some upper bounds for the signless Laplacian spectral radius of digraphs, Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs, Some bounds on the largest eigenvalues of graphs, Some results on the bounds of signless Laplacian eigenvalues, Relating hypergraph parameters of generalized power graphs, On the bounds for signless Laplacian energy of a graph, Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs, A sharp upper bound on the signless Laplacian spectral radius of graphs
Uses Software
Cites Work
- Signless Laplacians of finite graphs
- Bounds on the index of the signless Laplacian of a graph
- Laplacian matrices of graphs: A survey
- On the Laplacian spectral radius of a graph
- An upper bound on the sum of squares of degrees in a graph
- Upper bound for the Laplacian graph eigenvalues
- Properties of spectra of graphs and line graphs
- The best possible lower bound for the Perron root using traces
- The largest eigenvalue of a graph: A survey
- Lower bounds for the Perron root of a nonnegative matrix
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph