10 September 2014 in Mathematische Nachrichten
1 May 2012 in Linear Algebra and its Applications
20 January 2017 in Special Matrices
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. We determine the unique non-starlike non-caterpillar tree with maximal distance spectral radius.
1 January 2012 in Filomat
The Wiener index W(G) of a connected graph G is defined as the sum of distances between all unordered pairs of vertices of G. As a variation of the Wiener index, the reverse Wiener index of G is defined as ?(G) = ? n(n ? 1)d ? W(G), where n is the number of vertices, and d is the diameter of G. It is known that the star is the unique n-vertex tree with the smallest reverse Wiener index. We now determine the second and the third smallest reverse Wiener indices of n-vertex trees, and characterize the trees whose reverse Wiener indices attain these values for n ? 5.