Spectral determination of graphs with one positive anti-adjacency eigenvalue
From MaRDI portal
Publication:2113707
DOI10.1016/j.amc.2022.126995OpenAlexW4211174568MaRDI QIDQ2113707
Publication date: 14 March 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2022.126995
Related Items (6)
On the eccentricity matrices of trees: inertia and spectral symmetry ⋮ The eccentricity spread of weak-friendship graphs ⋮ On the least eccentricity eigenvalue of graphs ⋮ Extremal problems for the eccentricity matrices of complements of trees ⋮ On the eccentricity energy and eccentricity spectral radius of graphs with odd diameter ⋮ The eccentricity matrix of a digraph
Cites Work
- Unnamed Item
- Unnamed Item
- On the two largest \(Q\)-eigenvalues of graphs
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- The anti-adjacency matrix of a graph: eccentricity matrix
- New families of graphs determined by their generalized spectrum
- Kite graphs determined by their spectra
- Oriented graphs determined by their generalized skew spectrum
- Eccentricity energy change of complete multipartite graphs due to edge deletion
- Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra
- Spectral properties of the eccentricity matrix of graphs
- Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond
- Spectra of eccentricity matrices of graphs
- Energy and inertia of the eccentricity matrix of coalescence of graphs
- On the largest and least eigenvalues of eccentricity matrix of trees
- Enumeration of cospectral and coinvariant graphs
- On the spectral characterization of mixed extensions of \(P_3\)
- Spectral characterization of mixed extensions of small graphs
- The kite graph is determined by its adjacency spectrum
- The graphs cospectral with the pineapple graph
- The graphs with all but two eigenvalues equal to \(-2\) or 0
- On the eigenvalues of eccentricity matrix of graphs
- Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
This page was built for publication: Spectral determination of graphs with one positive anti-adjacency eigenvalue
