Eccentricity spectral properties of C-graphs
Abstract
A cograph is a simple graph that contains no induced path on four vertices. In this paper, we consider C-graphs, which are a specific class of cographs, defined as Kα1 Kα2 ·s Kα2k, % where k ≥ 2, α2k≥ 2, where k ≥ 2, α2k ≥ 2, and Kαi denotes the complete graph on αi 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 C-graphs. Furthermore, we identify an interval (-1-2,-2) (-2,0) in which these graphs have no eccentricity eigenvalues.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.