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
- \(D_{\max}\) -- matrix of dominant distances in a graph
- An extended eigenvalue-free interval for the eccentricity matrix of threshold graphs
- Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
- Energy and inertia of the eccentricity matrix of coalescence of graphs
- Graph energy based on the eccentricity matrix
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
- On graphs with exactly one anti-adjacency eigenvalue and beyond
- On the eccentricity energy and eccentricity spectral radius of graphs with odd diameter
- On the eccentricity spectra of complete multipartite graphs
- On the eccentricity spectra of threshold graphs
- On the eigenvalues of eccentricity matrix of graphs
- On the largest and least eigenvalues of eccentricity matrix of trees
- On the least eccentricity eigenvalue of graphs
- On the spectral radius and the energy of eccentricity matrices of graphs
- On the third largest eigenvalue of eccentricity matrices of graphs
- On two problems related to anti-adjacency (eccentricity) matrix
- Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond
- Some new considerations about double nested graphs
- Spectra of eccentricity matrices of graphs
- Spectra of graphs
- Spectral determination of graphs with one positive anti-adjacency eigenvalue
- Spectral determinations and eccentricity matrix of graphs
- Spectral properties of the eccentricity matrix of graphs
- The anti-adjacency matrix of a graph: eccentricity matrix
- The diameter and eccentricity eigenvalues of graphs
- The eccentricity matrix of a digraph
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)