Spectral spread and trace norm of eccentricity matrix of graphs.

The spectral spread of the eccentricity matrix E (G) of a graph G is defined as the difference between the largest and the smallest eigenvalue of E (G). While the trace norm of the eccentricity matrix is the absolute sum of the eigenvalues of E (G). In this paper, we obtain various bounds for the spread in terms of the various parameters of G and related it with the trace norm of E (G). We characterize some extremal graphs attaining such bounds. [ABSTRACT FROM AUTHOR]