Structural aspects of $1$-limited domination in cubic graphs
A set $D\subseteq V(G)$ is a $1$-limited dominating set of a graph $G$ if every vertex outside $D$ has a neighbor in $D$ and every vertex of $D$ has at most one neighbor outside $D$. The minimum cardinality among all $1$-limited dominating sets of $G$ is denoted by $\gamma_1^{\mathrm L}(G)$. For every cubic graph $G$ o...