Total [1,2]-domination in graphs

Xuezheng Lv, Baoyindureng Wu

A subset $S\subseteq V$ in a graph $G=(V,E)$ is a total $[1,2]$-set if, for every vertex $v\in V$, $1\le |N(v)\cap S|\le 2$. The minimum cardinality of a total $[1,2]$-set of $G$…