On graphs with third largest eccentricity eigenvalue in the interval \([ - 2, - 1 ]\) (Q6906703)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8115120
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On graphs with third largest eccentricity eigenvalue in the interval \([ - 2, - 1 ]\) |
scientific article; zbMATH DE number 8115120 |
Statements
On graphs with third largest eccentricity eigenvalue in the interval \([ - 2, - 1 ]\) (English)
0 references
4 November 2025
0 references
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.
0 references
eccentricity matrix
0 references
anti-adjacency matrix
0 references
third largest eigenvalue
0 references
chain graph
0 references
0 references
0 references
0 references
