Orientable total domination in graphs

Sarah E. Anderson, Tanja Dravec, Daniel Johnston +1

Given a directed graph $D$, a set $S\subseteq V(D)$ is a total dominating set of $D$ if each vertex in $D$ has an in-neighbor in $S$. The total domination number of $D$, denoted $…