1 problem

Let $D$ be a strong digraph with $n$ vertices. A pair is dominated or dominating when it is a pair of dominated or dominating nonadjacent vertices of $D$ as specified in the source…