The complexity of dominating set reconfiguration

Arash Haddadan, Takehiro Ito, Amer E. Mouawad +4

Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given threshold $k$. Then, we are asked whether there exists a sequen…