Upper bounds for inverse domination in graphs

Elliot Krop, Jessica McDonald, Gregory J. Puleo

In any graph $G$, the domination number $\gamma (G)$ is at most the independence number $\alpha (G)$. The Inverse Domination Conjecture says that, in any isolate-free $G$, there exists pair of…