Paper detail

Reconfiguring dominating sets in minor-closed graph classes

For a graph $G$, two dominating sets $D$ and $D&#39;$ in $G$, and a non-negative integer $k$, the set $D$ is said to $k$-transform to $D&#39;$ if there is a sequence $D_0,\ldots,D_\ell$ of dominating sets in $G$ such that $D=D_0$, $D&#39;=D_\ell$, $|D_i|\leq k$ for every $i\in \{ 0,1,\ldots,\ell\}$, and $D_i$ arises from $D_{i-1}$ by adding or removing one vertex for every $i\in \{ 1,\ldots,\ell\}$. We prove that there is some positive constant $c$ and there are toroidal graphs $G$ of arbitrarily large order $n$, and two minimum dominating sets $D$ and $D&#39;$ in $G$ such that $D$ $k$-transforms to $D&#39;$ only if $k\geq \max\{ |D|,|D&#39;|\}+c\sqrt{n}$. Conversely, for every hereditary class ${\cal G}$ that has balanced separators of order $n\mapsto n^α$ for some $α<1$, we prove that there is some positive constant $C$ such that, if $G$ is a graph in ${\cal G}$ of order $n$, and $D$ and $D&#39;$ are two dominating sets in $G$, then $D$ $k$-transforms to $D&#39;$ for $k=\max\{ |D|,|D&#39;|\}+\lfloor Cn^α\rfloor$.