For a connected graph $G$, the distance matrix is a real-symmetric matrix where the $(u,v)$-entry is the distance between vertex $u$ and vertex $v$ in $G$. The distance spectral radius of $G$ is the largest eigenvalue of the distance matrix. A series-reduced tree is a tree with at least one internal vertex and all internal vertices having degree at least three. Those series-reduced trees that maximize the distance spectral radius are determined over all series-reduced trees with fixed order and maximum degree and over all series-reduced trees with fixed order and domination number, respectively.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.