Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
