%0 Journal Article 
%A Kuziak, Dorota
%A Peterin, Iztok
%A González Yero, Ismael
%T Efficient open domination in graph products
%D 2014
%@ 1365-8050
%U http://hdl.handle.net/10498/30894
%X 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
%K efficient open domination
%K graph products
%K total domination
%~ Universidad de Cádiz