RT journal article
T1 Efficient open domination in graph products
A1 Kuziak, Dorota
A1 Peterin, Iztok
A1 González Yero, Ismael
A2 Estadística e Investigación Operativa
A2 Matemáticas
K1 efficient open domination
K1 graph products
K1 total domination
AB 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 partitionof $V(G)$. We completely describe efficient open domination graphs among lexicographicstrong and disjunctive products of graphs. For the Cartesian product we give a characterization whenone factor is $K_2$. A connection with total domination number is also established
SN 1365-8050
YR 2014
FD 2014-03-01
LK http://hdl.handle.net/10498/30894
UL http://hdl.handle.net/10498/30894
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026