Ordering trees by the spectral radius of Laplacian

DOI10.3792/PJAA.75.188MaRDI QIDQ1977019zbMATH OpenOpenAlexFDO

Authors 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

adjacency operatoralgebraic connectivityeigenvalue of Laplacianpartial orderingspectral radius

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5525812
• On the Laplacian spectral radii of trees
• Ordering trees with fixed order and matching number by Laplacian spectral radius
• Ordering trees by the Laplacian coefficients

Cites work

• Eigenvalue comparison theorems of the discrete Laplacians for a graph
• scientific article; zbMATH DE number 1308952 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Laplacian spectra and chromatic numbers of graphs
• On the eigenvalues of trees
• Ordering trees by algebraic connectivity
• The Faber-Krahn type isoperimetric inequalities for a graph
• The Laplacian Spectrum of a Graph

Cited in

(7)

• Ordering trees by the Laplacian coefficients
• Spectral ordering of trees with small index
• Ordering trees by their Laplacian spectral radii
• scientific article; zbMATH DE number 5525812 (Why is no real title available?)
• Ordering trees by their spectral radii
• A Good Leaf Order on Simplicial Trees
• On the ordering of trees by the Laplacian coefficients

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977019)