Rajesh Kannan

The eccentricity matrix ε(G) of a connected graph G is obtained from the distance matrix of G by keeping the largest nonzero entries in each row and each column, and leaving zeros in the remaining ones. The eigenvalues of ε(G) are the ε-eigenvalues...