3-Factor-criticality in double domination edge critical graphs

Haichao Wang, Erfang Shan, Yancai Zhao

A vertex subset $S$ of a graph $G$ is a double dominating set of $G$ if $|N[v]\cap S|\ge 2$ for each vertex $v$ of $G$, where $N[v]$ is the set of the vertex $v$ and vertices adja…