Metraipolis › archive › dc_691d645bbde9

The Spectral Theory of Cographs: A Survey, Organized by Graph Matrix — arXiv:2611.06981

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06981
License (as archived)
CC0-1.0
Archived
2026-11-06T14:52:54.255Z
SHA-256 of the archived text
a9e50ee347f2921aed0f91bbe48f19ed870fdb19304947e5ef7db4b37fbbb6f4
Stable URL of this page
https://metraipolis.com/documento/dc_691d645bbde9

How to cite

The Spectral Theory of Cographs: A Survey, Organized by Graph Matrix — arXiv:2611.06981 — arXiv (en), https://arxiv.org/abs/2611.06981 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_691d645bbde9 (Metraipolis archive dc_691d645bbde9, sha256 a9e50ee347f2921aed0f91bbe48f19ed870fdb19304947e5ef7db4b37fbbb6f4)
BibTeX
@misc{dc691d645bbde9,
  title = {The Spectral Theory of Cographs: A Survey, Organized by Graph Matrix — arXiv:2611.06981},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06981},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_691d645bbde9; sha256 a9e50ee347f2921aed0f91bbe48f19ed870fdb19304947e5ef7db4b37fbbb6f4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06981. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Cographs, the $P_4$-free graphs, are exactly the graphs obtained from a single vertex by repeated disjoint union and complementation. They contain the threshold graphs, $\mathcal{C}$-graphs and form one of the primary areas for spectral graph theory. This survey is organized by matrix: after a preliminary section, there is one section for each of the adjacency, Laplacian, signless Laplacian, distance, eccentricity, Seidel, distance Laplacian and distance signless Laplacian matrices. Within each section we collect what is known for general cographs, for the subclass of $\mathcal{C}$-graphs, and where relevant, for threshold graphs. We highlight the results from the recent years, including the foundational work of Mohammadian et al., Jacobs et al., Ghorbani, Li et al., Niu et al., Lou et al., Wang at al., Mandal et al. Two structural facts are used throughout: every connected cograph has diameter at most $2$, which ties all four distance-type matrices to the adjacency and Laplacian matrices, and the partition of the vertex set into twin classes is equitable for every one of the eight matrices, giving a uniform description of each spectrum (for the Laplacian this is the twin-reduction theory of Barik--Reddy, which we present in detail). Besides surveying the literature, we record several consequences, and mark them as such: an exact decomposition of the eccentricity matrix of a connected cograph, yielding an eigenvalue-free interval for the eccentricity spectrum of all connected cographs; the full distance Laplacian spectrum and its extremal eigenvalues; an eigenvalue-free interval for the distance signless Laplacian valid for every connected graph of diameter at most $2$; an interlacing theorem tying the distance spectrum to the adjacency spectrum. A comparison table across all eight matrices and a list of open problems close the paper.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: History and Overview (math.HO) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.06981 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:24:27.850Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).