Journal of the
Korean Mathematical Society
JKMS
ISSN(Print) 0304-9914
ISSN(Online) 2234-3008
Article
HOME
ALL ARTICLES
View
ALL ARTICLES
View
J. Korean Math. Soc. 1998; 35(4): 843-853
Printed December 1, 1998
Copyright © The Korean Mathematical Society.
Domination in digraphs
Chang Woo Lee
University of Seoul
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.
Keywords: domination number, digraph, random digraph
MSC numbers: 05C20, 05C80
Article Tools
Stats or Metrics
Share this article on :
Related articles in JKMS
-
The expected independent domination number of two types of trees
2002; 39(2): 205-219
-
The expected independent domination number of random directed rooted trees
2004; 41(5): 921-931
-
The bondage number of $C_3 \times C_n$
2007; 44(6): 1213-1231
-
Domination in graphs of minimum degree four
2009; 46(4): 759-773
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd