On graphs with third largest eccentricity eigenvalue in the interval [ - 2, - 1 ]

From MaRDI portal
Publication:6906703





The eccentricity matrix, also called the anti-adjacency matrix, of a graph can be obtained from its distance matrix by retaining the largest distances in each row and each column. In this paper, all connected graphs whose third largest eccentricity eigenvalue belongs to the interval \([-2,-1]\) are structurally characterized.



Cites work









This page was built for publication: On graphs with third largest eccentricity eigenvalue in the interval \([ - 2, - 1 ]\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906703)