Ordering trees by the spectral radius of Laplacian

DOI10.3792/PJAA.75.188zbMath0953.05047OpenAlexW2019656133MaRDI QIDQ1977019

Jinsong Tan

Publication date: 29 January 2001

Published in: Proceedings of the Japan Academy. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3792/pjaa.75.188

zbMATH Keywords

spectral radiusalgebraic connectivitypartial orderingadjacency operatoreigenvalue of Laplacian

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Eigenvalue comparison theorems of the discrete Laplacians for a graph
• The Faber-Krahn type isoperimetric inequalities for a graph
• On the eigenvalues of trees
• LAPLACIAN SPECTRA AND CHROMATIC NUBERS OF GRAPHS
• The Laplacian Spectrum of a Graph
• Ordering trees by algebraic connectivity

This page was built for publication: Ordering trees by the spectral radius of Laplacian