Inertia and spectral symmetry of eccentricity matrices of some clique trees

preprint2022arXivOpen access

Abstract

The eccentricity matrix E(G)\mathcal E(G) of a connected graph GG is obtained from the distance matrix of GG by leaving unchanged the largest nonzero entries in each row and each column, and replacing the remaining ones with zeros. In this paper, we consider the set CT\mathcal C \mathcal T of clique trees whose blocks have at most two cut-vertices \textcolor{blue}{of the clique tree}. After proving the irreducibility of the eccentricity matrix of a clique tree in CT\mathcal C \mathcal T and finding its inertia indices, we show that every graph in CT\mathcal C \mathcal T with more than 44 vertices and odd diameter has two positive and two negative E\mathcal E-eigenvalues. Positive E\mathcal E-eigenvalues and negative E\mathcal E-eigenvalues turn out to be equal in number even for graphs in CT\mathcal C \mathcal T with even diameter; that shared cardinality also counts the \textcolor{blue}{`diametrally distinguished'} vertices. Finally, we prove that the spectrum of the eccentricity matrix of a clique tree GG in CT\mathcal C \mathcal T is symmetric with respect to the origin if and only if GG has an odd diameter and exactly two adjacent central vertices.

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.