%0 Journal Article
%T Independent domination in directed graphs
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A Cary, Michael
%A Cary, Jonathan
%A Prabhu, Savari
%D 2021
%\ 06/01/2021
%V 6
%N 1
%P 67-80
%! Independent domination in directed graphs
%K dominating set
%K independent set
%K independent domination
%K independent dominating set
%K idomatic number
%R 10.22049/cco.2020.26845.1149
%X In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, trees, DAGs, cycles, and bipartite graphs. We also provide the idomatic number for special cases of some of these families of digraphs.
%U http://comb-opt.azaruniv.ac.ir/article_14099_2a712ed0e4c1659806f09f4a27c4425f.pdf