Domination in Digraphs
Given a digraph D = (V, A), with vertex set V and arc set A, a set S ⊆ V is a dominating set if for every vertex v in V \ S, there are a vertex u in S and an arc (u, v) from u to v. In this chapter we consider the counterparts in directed graphs of independent, dominating, independent dominating, and total dominating sets in undirected graphs.
Haynes, Teresa W.; Hedetniemi, Stephen T.; and Henning, Michael A.. 2021. Domination in Digraphs. Developments in Mathematics. Vol.66 387-428. https://doi.org/10.1007/978-3-030-58892-2_13 ISSN: 1389-2177