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

DOI10.1016/j.laa.2014.01.015zbMath1285.05113arXiv1311.3096OpenAlexW2037809348MaRDI QIDQ2442439

Guanglong Yu, Yong-Gao Chen, Shu-Guang Guo

Publication date: 3 April 2014

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

Full work available at URL: https://arxiv.org/abs/1311.3096

zbMATH Keywords

signless Laplacianleast eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Signed and weighted graphs (05C22)

Related Items (6)

On the smallest eigenvalue of D_α-matrix of connected graphs ⋮ On the \(A_\alpha\)-spectra of graphs ⋮ A sharp lower bound on the least signless Laplacian eigenvalue of a graph ⋮ Maximizing the least signless Laplacian eigenvalue of unicyclic graphs ⋮ Signless Laplacian eigenvalue problems of Nordhaus-Gaddum type ⋮ On the least eigenvalue of \(A_\alpha \)-matrix of graphs

Cites Work

• The smallest eigenvalue of the signless Laplacian
• Bounds on the \(Q\)-spread of a graph
• A note on Laplacian graph eigenvalues
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Matrix Analysis

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