Ordering trees by their largest eigenvalues (Q5898283): Difference between revisions

The paper studies eigenvalues of the adjacency matrices of trees. The paper charterizes which tree uniquely minimizes the largest eigenvalue among trees on \(n\) vertices and maximum degree \(\Delta\), and which tree uniquely maximizes the largest eigenvalue among the same trees for \(\lceil {n-2\over 2}\rceil \leq \Delta\). The paper also determines which \(n\)-vertex tree has the 13th largest eigenvalue among all \(n\)-vertex trees. The paper extends results of \textit{M. Hofmeister} [Linear Algebra Appl. 260, 43--59 (1997; Zbl 0876.05068)] and \textit{A. Chang} and \textit{Q. Huang} [Linear Algebra Appl. 370, 175--184 (2003; Zbl 1030.05029)].