Independent Domination in Subcubic Graphs

A. Akbari, S. Akbari, A. Doosthosseini +3

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in $S$. If, in addition, $S$ is an independent set, then $S$ is an indep…