Ordering trees by their spectral radii

DOI10.1007/S10255-014-0432-6zbMath1304.05096OpenAlexW2073228319MaRDI QIDQ477575

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

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

Related Items (2)

Ordering graphs by their largest (least) A_α-eigenvalues ⋮ On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching

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

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