On the graphs having at most one positive eccentricity eigenvalue

Sezer Sorgun, Hakan Küçük

The eccentricity (anti-adjacency) matrix $\epsilon (G)$ of a graph $G$ is obtained from the distance matrix by retaining the eccentricities in each row and each column. This matr…