Efficiently recognizing graphs with equal independence and annihilation numbers

Johannes Rauch, Dieter Rautenbach

The annihilation number $a(G)$ of a graph $G$ is an efficiently computable upper bound on the independence number $\alpha (G)$ of $G$. Recently, Hiller observed that a characterization o…