[1, 2]-sets and [1, 2]-total Sets in Trees with Algorithms

Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, Mohsen Alambardar Meybodi

A set $S\subseteq V$ of the graph $G=(V,E)$ is called a $[1,2]$-set of $G$ if any vertex which is not in $S$ has at least one but no more than two neighbors in $S$. A set $S \…