For a connected graph G , the distance matrix is real-symmetric where ( u v )-entry between vertex and in . The spectral radius of largest eigenvalue A series-reduced tree with at least one internal all vertices having degree three. Those trees that maximize are determined over fixed order maximum number leaves, respectively.