Eccentricity spectral properties of $\mathcal{C}$-graphs
Combinatorics
2025-09-23 v1
Abstract
A cograph is a simple graph that contains no induced path on four vertices. In this paper, we consider -graphs, which are a specific class of cographs, defined as %\text{ where } k \geq 2, \alpha_{2k}\geq 2, where , , and denotes the complete graph on vertices. We investigate the spectral properties of the eccentricity matrix of this particular class of cographs. Additionally, we determine the irreducibility and inertia of the eccentricity matrix of -graphs. Furthermore, we identify an interval in which these graphs have no eccentricity eigenvalues.
Cite
@article{arxiv.2509.16657,
title = {Eccentricity spectral properties of $\mathcal{C}$-graphs},
author = {Anjitha Ashokan and Chithra A},
journal= {arXiv preprint arXiv:2509.16657},
year = {2025}
}