Distance spectral radius of series-reduced trees with parameters

¹ School of Mathematical Sciences, South China Normal University, Guangzhou 510631, P.R. China
² School of Mathematics, South China University of Technology, Guangzhou 510641, P.R. China

^* Corresponding author: zhoubo@scnu.edu.cn

Received: 17 April 2020
Accepted: 30 August 2020

Abstract

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 of G. 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 number of leaves, respectively.