Characterization of graphs with orientable total domination number equal to $|V|-1$

Zoltán L. Blázsik, Leila Vivien Nagy

In a directed graph $D$, a vertex subset $S\subseteq V$ is a total dominating set if every vertex of $D$ has an in-neighbor from $S$. A total dominating set exists if and only if e…