Abstract
The \textit{eccentricity matrix} of a connected graph is obtained from the distance matrix of by keeping the largest non-zero entries in each row and each column, and leaving zeros in the remaining ones. The eigenvalues of are the \textit{-eigenvalues} of . In this article, we find the inertia of the eccentricity matrices of trees. Interestingly, any tree on more than vertices with odd diameter has two positive and two negative -eigenvalues (irrespective of the structure of the tree). A tree with even diameter has the same number of positive and negative -eigenvalues, which is equal to the number of 'diametrically distinguished' vertices (see Definition 3.1). Besides we prove that the spectrum of the eccentricity matrix of a tree is symmetric with respect to the origin if and only if the tree has odd diameter. As an application, we characterize the trees with three distinct -eigenvalues.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.