DOMINATION IN DIGRAPHS

  • 발행 : 1998.11.01

초록

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.

키워드