The eccentricity matrix (or anti-adjacency matrix) of a graph is constructed from its distance matrix by keeping in each row and each column only the largest distances. In this paper all connected graphs whose third largest anti-adjacency eigenvalue belongs to the interval [−2,−1] are structurally characterized.
On graphs with third largest eccentricity eigenvalue in the interval [−2,−1] / Song, Y.; Brunetti, M.; Wang, J.. - In: DISCRETE APPLIED MATHEMATICS. - ISSN 0166-218X. - 378:(2026), pp. 671-681. [10.1016/j.dam.2025.09.027]
On graphs with third largest eccentricity eigenvalue in the interval [−2,−1]
Brunetti M.Secondo
;
2026
Abstract
The eccentricity matrix (or anti-adjacency matrix) of a graph is constructed from its distance matrix by keeping in each row and each column only the largest distances. In this paper all connected graphs whose third largest anti-adjacency eigenvalue belongs to the interval [−2,−1] are structurally characterized.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
DAM_ThirdE_published.pdf
solo utenti autorizzati
Licenza:
Accesso privato/ristretto
Dimensione
534.68 kB
Formato
Adobe PDF
|
534.68 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
