On total dominating sets in graphs

Maryam Atapour, Nasrin Soltankhah

A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices…