For a connected graph G with vertex set V(G), the reverse distance matrix of G is defined as the matrix whose (u,v)-entry is d - d(G)(u,v) if u ? v, and 0 otherwise for u, v ? V(G), where d is the diameter and d(G)(u,v) is the distance between u and v in G. The reverse distance spectral radius of G is the largest eigenvalue of the reverse distance matrix of G. We determine the unique trees that minimize (maximize, respectively) the reverse distance spectral radius. We also identify the unique trees for which the complements minimize the reverse distance spectral radius and the unique n-vertex trees for which the complements achieve the i-th largest reverse distance spectral radius for all i =1, ..., left perpendicular n-2/2 right perpendicular
展开▼
