Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
From MaRDI portal
Publication:984856
DOI10.1016/J.LAA.2010.04.026zbMATH Open1215.05100OpenAlexW1981489568MaRDI QIDQ984856FDOQ984856
Authors: Yanqing Chen, Ligong Wang 
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
Recommendations
- Bounds for the largest two eigenvalues of the signless Laplacian
- Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph
- Some bounds on the largest eigenvalues of graphs
- Sharp bounds on the signless Laplacian spectral radii of graphs
- Some relations between the eigenvalues of adjacency, Laplacian and signless Laplacian matrix of a graph
Cites Work
- Signless Laplacians of finite graphs
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
- Laplacian matrices of graphs: A survey
- Properties of spectra of graphs and line graphs
- On the Laplacian spectral radius of a graph
- The largest eigenvalue of a graph: A survey
- Bounds on the index of the signless Laplacian of a graph
- An upper bound on the sum of squares of degrees in a graph
- Lower bounds for the Perron root of a nonnegative matrix
- Upper bound for the Laplacian graph eigenvalues
- The best possible lower bound for the Perron root using traces
Cited In (28)
- On maximum degree (signless) Laplacian matrix of a graph
- Upper bounds on the (signless) Laplacian eigenvalues of graphs
- Title not available (Why is that?)
- A sharp upper bound on the signless Laplacian spectral radius of graphs
- Some upper bounds for the signless Laplacian spectral radius of digraphs
- An upper bound on the largest signless Laplacian of an odd unicyclic graph
- Title not available (Why is that?)
- Eigenvalue bounds for the signless \(p\)-Laplacian
- Some results on the bounds of signless Laplacian eigenvalues
- Sharp bounds on the signless Laplacian spectral radii of graphs
- Some bounds on the largest eigenvalues of graphs
- Bounds for the largest two eigenvalues of the signless Laplacian
- Some results involving the \(A_\alpha\)-eigenvalues for graphs and line graphs
- Several sharp upper bounds for the largest Laplacian eigenvalue of a graph
- An upper bound on the sum of the \(k\) largest eigenvalues of the signless Laplacian matrix of a graph
- On the bounds for signless Laplacian energy of a graph
- On the spectral radius of the adjacency matrix and signless Laplacian matrix of a graph
- A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues
- A sharp upper bound on the least signless Laplacian eigenvalue using domination number
- A subdivision theorem for the largest signless Laplacian eigenvalue of a graph
- Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs
- Relating hypergraph parameters of generalized power graphs
- Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph
- Title not available (Why is that?)
- Some relations between the eigenvalues of adjacency, Laplacian and signless Laplacian matrix of a graph
- Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs
- Bounding the sum of the largest signless Laplacian eigenvalues of a graph
- A sharp lower bound on the least signless Laplacian eigenvalue of a graph
Uses Software
This page was built for publication: Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984856)
