Structure of tight (k,0)-stable graphs

Dingding Dong, Sammy Luo

We say that a graph G is $(k,\ell )$-stable if removing $k$ vertices from it reduces its independence number by at most $\ell$. We say that G is tight $(k,\ell )$-stable if it is $(k…