On Perfect and Quasiperfect Domination in Graphs

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

A subset $S\subseteq V$ in a graph $G=(V,E)$ is a $k$-quasiperfect dominating set (for $k\ge 1$) if every vertex not in $S$ is adjacent to at least one and at most $k$ vertices in…