Efficient Kernelization Algorithms for Modifying Graphs to Have at Most Two Distinct Eigenvalues

This paper presents efficient kernelization algorithms for modifying a given graph to have at most two distinct eigenvalues by vertex deletion, edge editing, edge deletion, and edge addition.