On the eccentricity matrices of trees: Inertia and spectral symmetry

preprint2022arXivOpen access

Abstract

The \textit{eccentricity matrix} E(G)\mathcal{E}(G) of a connected graph GG is obtained from the distance matrix of GG by keeping the largest non-zero entries in each row and each column, and leaving zeros in the remaining ones. The eigenvalues of E(G)\mathcal{E}(G) are the \textit{E\mathcal{E}-eigenvalues} of GG. In this article, we find the inertia of the eccentricity matrices of trees. Interestingly, any tree on more than 44 vertices with odd diameter has two positive and two negative E\mathcal{E}-eigenvalues (irrespective of the structure of the tree). A tree with even diameter has the same number of positive and negative E\mathcal{E}-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 E\mathcal{E}-eigenvalues.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.