On the Complexity of the Eigenvalue Deletion Problem

Neeldhara Misra, Harshil Mittal, Saket Saurabh +1

For any fixed positive integer $r$ and a given budget $k$, the $r$-\textsc{Eigenvalue Vertex Deletion} ($r$-EVD) problem asks if a graph $G$ admits a subset $S$ of at most $k$ vert…