Ordering trees by their spectral radii

DOI10.1007/S10255-014-0432-6zbMATH Open1304.05096OpenAlexW2073228319MaRDI QIDQ477575FDOQ477575

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

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

zbMATH Keywords

orderingspectral radius

Mathematics Subject Classification ID

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

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)

• Spectral ordering of trees with small index
• Ordering trees by their Laplacian spectral radii
• Title not available (Why is that?)
• On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching
• Ordering graphs by their largest (least) A_α-eigenvalues

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)