The Complete Classification of Graphs whose Second Largest Eigenvalue of the Eccentricity Matrix is Less Than 1
摘要
The eccentricity matrix of a graph is obtained from the distance matrix by keeping the entries that are largest in their row or column, and replacing the remaining entries by zero. This matrix can be interpreted as an opposite to the adjacency matrix, which is on the contrary obtained from the distance matrix by keeping only the entries equal to 1. In the paper, we determine graphs having the second largest eigenvalue of eccentricity matrix less than 1.