@misc{10498/30894,
year = {2014},
month = {3},
url = {http://hdl.handle.net/10498/30894},
abstract = {A graph $G$ is an efficient open domination graph if there exists a subset $D$
of $V(G)$ for which the open neighborhoods centered in vertices of $D$ form a partition
of $V(G)$. We completely describe efficient open domination graphs among lexicographic
strong and disjunctive products of graphs. For the Cartesian product we give a characterization when
one factor is $K_2$. A connection with total domination number is also established},
keywords = {efficient open domination},
keywords = {graph products},
keywords = {total domination},
title = {Efficient open domination in graph products},
doi = {10.46298/dmtcs.1267},
author = {Kuziak, Dorota and Peterin, Iztok and González Yero, Ismael},
}