The complete classification of graphs whose second largest eigenvalue of the eccentricity matrix is less than 1
From MaRDI portal
(Redirected from Publication:6596313)
Recommendations
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
- Eccentricity energy change of complete multipartite graphs due to edge deletion
- Energy and inertia of the eccentricity matrix of coalescence of graphs
- Generalized line graphs with the second largest eigenvalue at most 1
- Graph energy based on the eccentricity matrix
- scientific article; zbMATH DE number 3825855 (Why is no real title available?)
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- Inequalities for Graph Eigenvalues
- Lexicographic polynomials of graphs and their spectra
- On bicyclic graphs whose second largest eigenvalue does not exceed 1
- On graphs whose second largest eigenvalue equals 1 -- the star complement technique
- On graphs whose second largest eigenvalue is at most 1
- On graphs with exactly one anti-adjacency eigenvalue and beyond
- On graphs with exactly one eigenvalue less than -1
- On graphs with unicyclic star complement for 1 as the second largest eigenvalue
- On nested split graphs whose second largest eigenvalue is less than 1
- On the eccentricity matrices of trees: inertia and spectral symmetry
- 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 spectral characterization of mixed extensions of P₃
- On the spectral radius and the energy of eccentricity matrices of graphs
- On tricyclic graphs whose second largest eigenvalue does not exceed 1
- On unicyclic graphs whose second largest eigenvalue does not exceed 1
- Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond
- Spectra of eccentricity matrices of graphs
- Spectra of generalized compositions of graphs and hierarchical networks
- Spectra of graphs
- Spectra of graphs obtained by a generalization of the join graph operation
- Spectral characterization of mixed extensions of small 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 H-join of arbitrary families of graphs -- the universal adjacency spectrum
- The anti-adjacency matrix of a graph: eccentricity matrix
- The Laplacian spectra of graphs with a tree structure
Cited in
(5)- Graphs with large multiplicity of \(-2\) in the spectrum of the eccentricity matrix
- Eccentricity matrix of corona of two graphs
- Inertia and spectral symmetry for the eccentricity matrices of clique trees
- On the third largest eigenvalue of eccentricity matrices of graphs
- On irreducibility of eccentricity matrix of graphs and construction of -equienergetic graphs
This page was built for publication: The complete classification of graphs whose second largest eigenvalue of the eccentricity matrix is less than 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596313)
