Stevanovic, Dragan; Ilic, Aleksandar Distance spectral radius of trees with fixed maximum degree. (English) Zbl 1189.05050 Electron. J. Linear Algebra 20, 168-179 (2010). Summary: Distance energy is a newly introduced molecular graph-based analog of the total \(\pi\)-electron energy, and it is defined as the sum of the absolute eigenvalues of the molecular distance matrix. For trees and unicyclic graphs, distance energy is equal to the doubled value of the distance spectral radius. In this paper, we introduce a general transformation that increases the distance spectral radius and provide an alternative proof that the path \(P_n\) has the maximal distance spectral radius among trees on \(n\) vertices. Among the trees with a fixed maximum degree \(\Delta\), we prove that the broom \(B_{n,\Delta}\) (consisting of a star \(S_{\Delta+1}\) and a path of length \(n - \Delta - 1\) attached to an arbitrary pendent vertex of the star) is the unique tree that maximizes the distance spectral radius, and conjecture the structure of a tree which minimizes the distance spectral radius. As a first step towards this conjecture, we characterize the starlike trees with the minimum distance spectral radius. Cited in 2 ReviewsCited in 59 Documents MSC: 05C05 Trees 05C12 Distance in graphs Keywords:distance matrix; distance spectral radius; Broom graph; maximum degree PDFBibTeX XMLCite \textit{D. Stevanovic} and \textit{A. Ilic}, Electron. J. Linear Algebra 20, 168--179 (2010; Zbl 1189.05050) Full Text: DOI arXiv EuDML EMIS