대한수학회지 (Journal of the Korean Mathematical Society)
- 제35권4호
- /
- Pages.843-853
- /
- 1998
- /
- 0304-9914(pISSN)
- /
- 2234-3008(eISSN)
DOMINATION IN DIGRAPHS
초록
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.