On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph

DOI10.1007/BF02669571zbMath0979.05071MaRDI QIDQ5942761

Jiong-Sheng Li, Xiao Dong Zhang

Publication date: 16 January 2002

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

eigenvaluespanning treeLaplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items (4)

Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues ⋮ Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection ⋮ Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph ⋮ Bounds for the Laplacian spectral radius of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplacian matrices of graphs: A survey
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• Minimum higher eigenvalues of Laplacians on graphs
• The Laplacian Spectrum of a Graph II

This page was built for publication: On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph