Critical graphs upon multiple edge subdivision

Magda Dettlaff, Magdalena Lemanska, Adriana Roux

A subset $D$ of $V$ is \emph{dominating} in $G$ if every vertex of $V-D$ has at least one neighbour in $D;$ let $\gamma (G)$ be the minimum cardinality among all dominating sets in $G.$…