Paired and semipaired domination in triangulations

M. Claverol, C. Hernando, M. Maureso +2

A dominating set of a graph $G$ is a subset $D$ of vertices such that every vertex not in $D$ is adjacent to at least one vertex in $D$. A dominating set $D$ is paired if the subgr…