Upper bounds on the (signless) Laplacian eigenvalues of graphs

DOI10.1016/j.laa.2014.07.018zbMath1300.05159OpenAlexW2022283705MaRDI QIDQ401193

Muhuo Liu, Hai-Ying Shan, Kinkar Chandra Das

Publication date: 26 August 2014

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

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

zbMATH Keywords

diameterLaplacian spectrumLaplacian matrixsignless Laplacian matrixsignless Laplacian spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (2)

On two conjectures of spectral graph theory ⋮ Nordhaus-Gaddum-type result on the second largest signless Laplacian eigenvalue of a graph

Cites Work

• Signless Laplacians of finite graphs
• A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
• A note on Laplacian graph eigenvalues
• Laplacian matrices of graphs: A survey
• An improved upper bound for Laplacian graph eigenvalues
• The Laplacian spectrum of a graph
• Sharp lower bounds on the Laplacian eigenvalues of trees
• Interlacing eigenvalues and graphs
• Proof of conjectures involving algebraic connectivity of graphs
• Some graphs determined by their (signless) Laplacian spectra
• On the second largest Laplacian eigenvalue of trees
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• Matrix Analysis
• Eigenvalues of the Laplacian of a graph^∗
• The largest two Laplacian eigenvalues of a graph

This page was built for publication: Upper bounds on the (signless) Laplacian eigenvalues of graphs