On $1$-limited and $(1,2)$-domination in cubic graphs

Goran Radić, Aleksandra Tepeh

A dominating set $D$ of a graph is called $1$-limited if every vertex of $D$ has at most one neighbor outside $D$, while a $(1,2)$-dominating set is a dominating set in which every…