Spectral properties of the eccentricity matrix of graphs
From MaRDI portal
Publication:2181226
DOI10.1016/j.dam.2019.10.015zbMath1439.05146OpenAlexW2981851373WikidataQ126983702 ScholiaQ126983702MaRDI QIDQ2181226
Mei Lu, Lu Lu, Francesco Belardo, Jianfeng Wang
Publication date: 18 May 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.10.015
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (22)
On the eccentricity spectra of complete multipartite graphs ⋮ Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \) ⋮ On the eccentricity matrices of trees: inertia and spectral symmetry ⋮ On the eigenvalues of eccentricity matrix of graphs ⋮ Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond ⋮ Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\) ⋮ On the spectral radius and the energy of eccentricity matrices of graphs ⋮ On the least eccentricity eigenvalue of graphs ⋮ Extremal problems for the eccentricity matrices of complements of trees ⋮ Some properties on eccentricity matrices of uniform hypertrees ⋮ On two problems related to anti-adjacency (eccentricity) matrix ⋮ Eccentricity spectral radius of \(t\)-clique trees with given diameter ⋮ Characterizing signed mixed graphs with small eigenvalues ⋮ On the eccentricity energy and eccentricity spectral radius of graphs with odd diameter ⋮ On graphs with exactly one anti-adjacency eigenvalue and beyond ⋮ An extended eigenvalue-free interval for the eccentricity matrix of threshold graphs ⋮ Energy and inertia of the eccentricity matrix of coalescence of graphs ⋮ On the largest and least eigenvalues of eccentricity matrix of trees ⋮ On the eccentricity spectra of threshold graphs ⋮ Eccentricity energy change of complete multipartite graphs due to edge deletion ⋮ The eccentricity matrix of a digraph ⋮ Spectral determination of graphs with one positive anti-adjacency eigenvalue
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The least eigenvalue of the complements of trees
- The Laplacian spectral radii of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- On the spectral radius of graphs with connectivity at most \(k\)
- Developments on spectral characterizations of graphs
- Problems in algebraic combinatorics
- The maximal exceptional graphs
- Which graphs are determined by their spectrum?
- Hoffman-type identities
- The spectral radius of graphs on surfaces
- Extremal hexagonal chains concerning largest eigenvalue
- The anti-adjacency matrix of a graph: eccentricity matrix
- On graphs with smallest eigenvalue at least \(-3\) and their lattices
- The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
- Spectra of eccentricity matrices of graphs
- Graph energy based on the eccentricity matrix
- Three conjectures in extremal spectral graph theory
- Complete multipartite graphs are determined by their distance spectra
- Spectral determinations and eccentricity matrix of graphs
- On the Polynomial of a Graph
- The largest eigenvalue of a graph: A survey
This page was built for publication: Spectral properties of the eccentricity matrix of graphs