Trees with given maximum degree minimizing the spectral radius

DOI10.13001/1081-3810.3323zbMath1339.05058OpenAlexW2418548498MaRDI QIDQ2813062

Xue Du, Ling-Sheng Shi

Publication date: 14 June 2016

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/15c2a5ca3aca59627e6dd0934289a3abbe1f3498

zbMATH Keywords

spectral radiusmaximum degreeoptimizing

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The spectral radii of a graph and its line graph
• Asymptotic results on the spectral radius and the diameter of graphs
• Wiener index versus maximum degree in trees
• Graphs with diameter \(n - e\) minimizing the spectral radius
• On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
• On the eigenvalues of trees
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones

This page was built for publication: Trees with given maximum degree minimizing the spectral radius