@article {IOPORT.06039474,
    author       = {Caro, Yair and Henning, Michael A.},
    title        = {Directed domination in oriented graphs.},
    year         = {2012},
    journal      = {Discrete Applied Mathematics},
    volume       = {160},
    number       = {7-8},
    issn         = {0166-218X},
    pages        = {1053-1063},
    publisher    = {Elsevier Science B.V. (North-Holland), Amsterdam},
    doi          = {10.1016/j.dam.2011.12.027},
    abstract     = {Summary: A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u\in V(D)\setminus S$ has an adjacent vertex v in S with v directed to u. The directed domination number of $D$, denoted by $\gamma (D)$, is the minimum cardinality of a directed dominating set in $D$. The directed domination number of a graph $G$, denoted by $\Gamma _{d}(G)$, is the maximum directed domination number $\gamma (D)$ over all orientations $D$ of $G$. The directed domination number of a complete graph was first studied by {\it P. Erd\"os} [``On Sch\"utte problem,'' Math. Gaz. 47, 220 -- 222 (1963)], albeit in disguised form. The authors [``A Greedy partition lemma for directed domination,'' Discrete Optim. 8, No. 3, 452--458 (2011; Zbl 1236.05142)] recently extended this notion to directed domination of all graphs. In this paper we continue this study of directed domination in graphs. We show that the directed domination number of a bipartite graph is precisely its independence number. Several lower and upper bounds on the directed domination number are presented.},
    identifier   = {06039474},
}