A note on the signless Laplacian eigenvalues of graphs

DOI10.1016/j.laa.2011.04.004zbMath1225.05176MaRDI 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

zbMATH Keywords

signless Laplacian; equitable partition; interlacing theorem; third largest eigenvalue

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph, Unnamed Item, Bounding the sum of the largest signless Laplacian eigenvalues of a graph, Some results on the A _α -eigenvalues of a graph, Complete split graph determined by its (signless) Laplacian spectrum, A lower bound for the sum of the two largest signless Laplacian eigenvalues, Kite graphs determined by their spectra, On graphs with exactly three \(Q\)-eigenvalues at least two, Signless Laplacian determination for a family of double starlike trees, Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\), Signless Laplacian eigenvalues and circumference of graphs, Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights, Signless Laplacian spectral characterization of line graphs ofT-shape trees, On the signless Laplacian spectral determination of the join of regular graphs

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