On the sum of the two largest Laplacian eigenvalues of trees

DOI10.1186/1029-242X-2014-242zbMath1307.05138WikidataQ59323568 ScholiaQ59323568MaRDI QIDQ2258642

Mei Guan, Ming-qing Zhai, Yong-Feng Wu

Publication date: 26 February 2015

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

zbMATH Keywords

upper boundLaplacian matrix

Mathematics Subject Classification ID

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

Related Items (6)

Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues ⋮ On the full Brouwer's Laplacian spectrum conjecture ⋮ On the Ky Fan $k$-norm of the $LI$-matrix of graphs ⋮ Unnamed Item ⋮ Least eigenvalue of the connected graphs whose complements are cacti ⋮ On the sum of the two largest Laplacian eigenvalues of unicyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• On the second Laplacian eigenvalues of trees of odd order
• Algebraic connectivity and degree sequences of trees
• On the sum of Laplacian eigenvalues of graphs
• A note on Laplacian graph eigenvalues
• On the sum of the Laplacian eigenvalues of a tree
• On the second largest Laplacian eigenvalue of trees
• The Laplacian Spectrum of a Graph
• Eigenvalues of the Laplacian of a graph^∗
• Extremizing algebraic connectivity subject to graph theoretic constraints

This page was built for publication: On the sum of the two largest Laplacian eigenvalues of trees