Bounds on the independence number and signless Laplacian index of graphs

DOI10.1016/j.laa.2017.10.026zbMath1377.05110OpenAlexW2767039348MaRDI QIDQ1688866

Mei Lu, Huiqing Liu

Publication date: 12 January 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2017.10.026

zbMATH Keywords

independence numbersignless Laplacian index

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Extremal (balanced) blow-ups of trees with respect to the signless Laplacian index ⋮ Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\)

Cites Work

• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• On the signless Laplacian index and radius of graphs
• On the signless Laplacian index of unicyclic graphs with fixed diameter
• Signless Laplacians of finite graphs
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Bounds and conjectures for the signless Laplacian index of graphs
• Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
• Edge-connectivity and (signless) Laplacian eigenvalue of graphs
• Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
• A conjecture on the diameter and signless Laplacian index of graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees

This page was built for publication: Bounds on the independence number and signless Laplacian index of graphs