On independent $[1,2]$-sets in trees

Sahar Aleid, Jose Caceres, Maria Luz Puertas

An independent $[1,k]$-set $S$ in a graph $G$ is a dominating set which is independent and such that every vertex not in $S$ has at most $k$ neighbors in it. The existence of such…