A sharp lower bound on the least signless Laplacian eigenvalue of a graph

DOI10.1007/s40840-016-0440-1zbMath1404.05110OpenAlexW3143897850MaRDI QIDQ1714042

Xiaodan Chen, Yao-Ping Hou

Publication date: 31 January 2019

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-016-0440-1

zbMATH Keywords

lower boundsignless Laplacianleast eigenvalue

Mathematics Subject Classification ID

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

Related Items (max. 100)

Decomposition of Gaussian processes, and factorization of positive definite kernels ⋮ On the least eigenvalue of \(A_\alpha \)-matrix of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The smallest eigenvalue of the signless Laplacian
• Signless Laplacians of finite graphs
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Bounds on the \(Q\)-spread of a graph
• Recent results in the theory of graph spectra
• Laplacian matrices of graphs: A survey
• On the Laplacian spectral radius of a tree.
• The Laplacian spectrum of a graph
• A lower bound on the least signless Laplacian eigenvalue of a graph
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Eigenvalues of the Laplacian of a graph^∗
• A characterization of the smallest eigenvalue of a graph

This page was built for publication: A sharp lower bound on the least signless Laplacian eigenvalue of a graph