1. Bange, D.W., Barkauskas, A.E., Clark, L.H.: Efficient domination of the orientations of a graph. Discret. Math. 178, 1–14 (1998)
2. Bange, D.W., Barkauskas, A.E., Slater, P.J.: Efficient dominating sets in graphs. In: Ringeisen, R.D., Roberts, F.S. (eds.) Applications of Discrete Mathematics, pp. 189–199. SIAM, Philadelphia (1988)
3. Barkauskas, A.E., Host, L.H.: Finding efficient dominating sets in oriented graphs. Congr. Numer. 98, 189–199 (1993)
4. Dejter, I.J.: Worst-case efficient dominating sets in digraphs. Discret. Appl. Math. 161, 944–952 (2013)
5. Dejter, I.J., Serra, O.: Efficient dominating sets in Cayley graphs. Discret. Appl. Math. 129, 319–328 (2003)