Bounds on the 2-domination number

Csilla Bujtás, Szilárd Jaskó

In a graph $G$, a set $D\subseteq V(G)$ is called 2-dominating set if each vertex not in $D$ has at least two neighbors in $D$. The 2-domination number ${\gamma }_2(G)$ is the minimum card…