A note on the signless Laplacian eigenvalues of graphs
From MaRDI portal
Publication:550641
DOI10.1016/j.laa.2011.04.004zbMath1225.05176OpenAlexW1979604682MaRDI QIDQ550641
Francesco Belardo, Jianfeng Wang
Publication date: 13 July 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.04.004
Related Items
Complete split graph determined by its (signless) Laplacian spectrum ⋮ Signless Laplacian determination for a family of double starlike trees ⋮ Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph ⋮ Signless Laplacian spectral characterization of line graphs ofT-shape trees ⋮ On the signless Laplacian spectral determination of the join of regular graphs ⋮ Bounding the sum of the largest signless Laplacian eigenvalues of a graph ⋮ Unnamed Item ⋮ On graphs with exactly three \(Q\)-eigenvalues at least two ⋮ Some results on the A α -eigenvalues of a graph ⋮ Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\) ⋮ Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights ⋮ Signless Laplacian eigenvalues and circumference of graphs ⋮ Kite graphs determined by their spectra ⋮ A lower bound for the sum of the two largest signless Laplacian eigenvalues
Cites Work
- Unnamed Item
- Signless Laplacians of finite graphs
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- Eigenvalue bounds for the signless laplacian
- Towards a spectral theory of graphs based on the signless Laplacian, I
- Towards a spectral theory of graphs based on the signless Laplacian, III