Reconfiguration of Dominating Sets

Akira Suzuki, Amer E. Mouawad, Naomi Nishimura

We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S$ of vertices such that each vertex is either in $S$ or has a n…