DOMINATION IN DIGRAPHS
Chang-Woo Lee · Journal of the Korean Mathematical Society · 1998
We establish bounds for the domination number of a digraph in terms of the minimum indegree and the order, and then we find a sharp upper bound for the domination number of a weak digraph with minimum indegree one. We also determine the domination number of a random digraph.