Two Bounds for the Domination Number of a Graph
Juhani Nieminen · IMA Journal of Applied Mathematics · 1974
Upper and lower bounds are obtained for the domination number of a graph, by means of a lemma involving the concept of a minimum dominating set of vertices. Although these results are obtained explicitly for graphs, there are analogous results in the theory of directed graphs.