Perfect and quasiperfect domination in trees

José Cáceres, Carmen Hernando, Mercé Mora +2

A $k-$quasiperfect dominating set ($k\ge 1$) of a graph $G$ is a vertex subset $S$ such that every vertex not in $S$ is adjacent to at least one and at most k vertices in $S$. The…