The complete classification of graphs whose second largest eigenvalue of the eccentricity matrix is less than 1
From MaRDI portal
Publication:6596313
DOI10.1007/s10114-024-2413-xzbMATH Open1546.0509MaRDI QIDQ6596313
Xingyu Lei, Jianfeng Wang, Zoran Stanić, Shuchao Li
Publication date: 2 September 2024
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On tricyclic graphs whose second largest eigenvalue does not exceed 1
- Spectra of graphs
- Spectra of generalized compositions of graphs and hierarchical networks
- On graphs whose second largest eigenvalue equals 1 -- the star complement technique
- On nested split graphs whose second largest eigenvalue is less than 1
- On graphs with exactly one eigenvalue less than -1
- On unicyclic graphs whose second largest eigenvalue does not exceed 1
- The anti-adjacency matrix of a graph: eccentricity matrix
- Spectra of graphs obtained by a generalization of the join graph operation
- On graphs whose second largest eigenvalue is at most 1
- On the eccentricity spectra of threshold graphs
- Eccentricity energy change of complete multipartite graphs due to edge deletion
- Spectral determination of graphs with one positive anti-adjacency eigenvalue
- On the eccentricity spectra of complete multipartite graphs
- The \(H\)-join of arbitrary families of graphs -- the universal adjacency spectrum
- On the eccentricity matrices of trees: inertia and spectral symmetry
- 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
- Graph energy based on the eccentricity matrix
- On the spectral characterization of mixed extensions of \(P_3\)
- Spectral characterization of mixed extensions of small graphs
- On bicyclic graphs whose second largest eigenvalue does not exceed 1
- On the eigenvalues of eccentricity matrix of graphs
- Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
- Spectral determinations and eccentricity matrix of graphs
- On graphs with exactly one anti-adjacency eigenvalue and beyond
- An extended eigenvalue-free interval for the eccentricity matrix of threshold graphs
- Generalized line graphs with the second largest eigenvalue at most 1
- The Laplacian spectra of graphs with a tree structure
- Lexicographic polynomials of graphs and their spectra
- Inequalities for Graph Eigenvalues
- On the spectral radius and the energy of eccentricity matrices of graphs
Related Items (2)
Graphs with large multiplicity of \(-2\) in the spectrum of the eccentricity matrix ⋮ Eccentricity matrix of corona of two graphs
This page was built for publication: The complete classification of graphs whose second largest eigenvalue of the eccentricity matrix is less than 1