On the smallest signless Laplacian eigenvalue of graphs

DOI10.1016/j.laa.2021.12.001zbMath1489.05097OpenAlexW4200584805MaRDI QIDQ2070846

Mohammad Reza Oboudi

Publication date: 24 January 2022

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

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

zbMATH Keywords

chromatic numbersignless Laplacian matrixsmallest signless Laplacian eigenvaluegraph surgery methods

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Coloring of graphs and hypergraphs (05C15)

Cites Work

• The clique number and the smallest \(Q\)-eigenvalue of graphs
• Majorization for partially ordered sets
• The smallest eigenvalue of the signless Laplacian
• Signless Laplacian spectral radii of graphs with given chromatic number
• Majorization and the spectral radius of starlike trees
• Signless Laplacians of finite graphs
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Majorization and the Lorenz order: a brief introduction
• A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization
• Properties of spectra of graphs and line graphs
• Distance spectral radius of complete multipartite graphs and majorization
• The smallest signless Laplacian eigenvalue of graphs under perturbation
• Eigenvalue bounds for the signless laplacian
• A characterization of the smallest eigenvalue of a graph
• Inequalities: theory of majorization and its applications

This page was built for publication: On the smallest signless Laplacian eigenvalue of graphs