Publication | Closed Access
DOMINATION IN DIGRAPHS
32
Citations
0
References
1998
Year
Graph MinorDirected GraphGraph TheoryComparative LiteratureRandom GraphStructural Graph TheoryTopological Graph TheoryRandom DigraphWeak DigraphNetwork AnalysisDomination NumberComputational ComplexityEducationPoeticsExtremal CombinatoricsDiscrete MathematicsExtremal Graph TheoryDomination 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.