Eigenvalue location in cographs

Abstract

We give an $O(n)$ time and space algorithm for constructing a diagonal matrix congruent to A+xI, where A is the adjacency matrix of a cograph and $x\in \mathbb{R}$. Applications include determining the number of eigenvalues of a cograph's adjacency matrix that lie in any interval, obtaining a formula for the inertia of a cograph, and exhibiting infinitely many pairs of equienergetic cographs with integer energy.

Cited by in corpus (3)

• A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
• Integral cographs and applications
• On I-eigenvalue free threshold graphs