Ordering trees by their spectral radii

DOI10.1007/S10255-014-0432-6MaRDI QIDQ477575zbMATH OpenOpenAlexFDO

Authors Ai-Mei Yu

Publication date 9 December 2014

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

Full work available at URL https://doi.org/10.1007/s10255-014-0432-6

zbMATH Keywords

orderingspectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• Ordering trees by their Laplacian spectral radii
• scientific article; zbMATH DE number 5525812
• A note on spectral radius of trees
• Ordering trees by the spectral radius of Laplacian
• Spectral ordering of trees with small index

Cites work

• Some notes on graphs whose spectral radius is close to \(\frac{3}{2}\sqrt 2\)
• The largest eigenvalue of a graph: A survey

Cited in

(5)

• Ordering graphs by their largest (least) A_α-eigenvalues
• 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?)
• On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching

This page was built for publication: Ordering trees by their spectral radii

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