On the largest and least eigenvalues of eccentricity matrix of trees

DOI10.1016/J.DISC.2021.112662MaRDI QIDQ2237236zbMATH OpenOpenAlexFDO

Authors Xiaocong He, Lu Lu

Publication date 27 October 2021

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2007.10600

zbMATH Keywords

diametereccentricity matrixleast eigenvaluespectral radius

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Abstract: The eccentricity matrix $varepsilon(G)$ of a graph $G$ is constructed from the distance matrix of $G$ by keeping only the largest distances for each row and each column. This matrix can be interpreted as the opposite of the adjacency matrix obtained from the distance matrix by keeping only the distances equal to 1 for each row and each column. The $varepsilon$-eigenvalues of a graph $G$ are those of its eccentricity matrix $varepsilon(G)$. Wang et al cite{e} proposed the problem of determining the maximum $varepsilon$-spectral radius of trees with given order. In this paper, we consider the above problem of $n$-vertex trees with given diameter. The maximum $varepsilon$-spectral radius of $n$-vertex trees with fixed odd diameter is obtained, and the corresponding extremal trees are also determined. The trees with least $varepsilon$-eigenvalues in $[-2sqrt2,0)$ have been known. Finally, we determine the trees with least $varepsilon$-eigenvalues in $[-2-sqrt13,-2sqrt2)$.

Recommendations

• Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond
• Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
• On the spectral radius and the energy of eccentricity matrices of graphs
• Eccentricity spectral radius of t-clique trees with given diameter
• On the least eccentricity eigenvalue of graphs

Cites work

• \(D_{\max}\) -- matrix of dominant distances in a graph
• A bound on the spectral radius of graphs in terms of their Zagreb indices
• Connectivity, diameter, independence number and the distance spectral radius of graphs
• Distance spectra of graphs: a survey
• Distance spectral radius of trees with fixed number of pendent vertices
• Distance spectral radius of trees with given number of segments
• Eigenspaces of graphs
• Energy and inertia of the eccentricity matrix of coalescence of graphs
• Extremal cacti of given matching number with respect to the distance spectral radius
• Further results on the distance spectral radius of graphs
• Graph energy based on the eccentricity matrix
• Graph theory
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 193132 (Why is no real title available?)
• scientific article; zbMATH DE number 6282149 (Why is no real title available?)
• On distance spectral radius of graphs
• On the distance spectra of threshold graphs
• On the eigenvalues of eccentricity matrix of graphs
• Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond
• Spectra of eccentricity matrices of graphs
• Spectra of graphs
• Spectral properties of the eccentricity matrix of graphs
• Spectral radius of graphs with given matching number
• The anti-adjacency matrix of a graph: eccentricity matrix
• The distance spectral radius of graphs with given independence number.
• The spectral radius of edge chromatic critical graphs

Cited in

(25)

• 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
• On the eccentricity spectra of complete multipartite graphs
• On the eccentricity matrices of trees: inertia and spectral symmetry
• Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
• On graphs with exactly one anti-adjacency eigenvalue and beyond
• 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
• The minimum -spectral radius of t-clique trees with given diameter
• Eccentricity spectral radius of t-clique trees with given diameter
• On the eccentricity energy and eccentricity spectral radius of graphs with odd diameter
• The diameter and eccentricity eigenvalues of graphs
• The complete classification of graphs whose second largest eigenvalue of the eccentricity matrix is less than 1
• Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number
• Note on the eccentricity spectral radius of uniform hypertrees with given diameter
• Eccentricity matrix of corona of two graphs
• Minimizers for the energy of eccentricity matrices of trees
• The \(\varepsilon\)-spectral radius of trees with perfect matchings
• The -spectral radii of k-uniform hypertrees
• On graphs with third largest eccentricity eigenvalue in the interval \([ - 2, - 1 ]\)
• On the third largest eigenvalue of eccentricity matrices of graphs
• Characterization of trees with second minimum eccentricity energy
• Minimal spectral radius of graphs with given matching number

This page was built for publication: On the largest and least eigenvalues of eccentricity matrix of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237236)