A digraph D
is an efficient open domination digraph if there exists a subset S
for which the open out-neighborhoods centered in the vertices of S
form a partition of
. In this work we deal with the efficient open domination digraphs among four standard products of digraphs. We present a method for constructing the efficient open domination Cartesian product of digraphs with one fixed factor. In particular, we characterize those for which the first factor has an underlying graph that is a path, a cycle or a star. We also characterize the efficient open domination strong product of digraphs that have factors whose underlying graphs are uni-cyclic graphs. The full characterizations of the efficient open domination direct and lexicographic product of digraphs are also given.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited