On the number of Laplacian eigenvalues of trees less than the average degree

DOI10.1016/J.DISC.2020.111986zbMath1445.05063OpenAlexW3027821369MaRDI QIDQ785785

Changhyon Sin

Publication date: 12 August 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2020.111986

zbMATH Keywords

treeeigenvalue distributionLaplacian eigenvaluesLaplacian energy

Mathematics Subject Classification ID

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

Related Items (5)

Classification of trees by Laplacian eigenvalue distribution and edge covering number ⋮ On a conjecture of Laplacian energy of trees ⋮ Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond ⋮ Locating Eigenvalues of Symmetric Matrices - A Survey ⋮ Most Laplacian eigenvalues of a tree are small

Cites Work

• Unnamed Item
• On the distribution of Laplacian eigenvalues of trees
• On the number of Laplacian eigenvalues of trees smaller than two
• Locating the eigenvalues of trees
• Domination number and Laplacian eigenvalue distribution
• Laplacian energy of diameter 3 trees
• On the sum of the Laplacian eigenvalues of a tree
• Eigenvalues of the Laplacian of a graph^∗
• The Laplacian Spectrum of a Graph II
• Reducing the adjacency matrix of a tree
• A Conjecture on Laplacian Eigenvalues of Trees

This page was built for publication: On the number of Laplacian eigenvalues of trees less than the average degree