Efficient open domination in graph productsKuziak, Dorota (Avtor) Peterin, Iztok (Avtor) Yero, Ismael G. (Avtor) graph theoryefficient open dominationgraph productstotal dominationA 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$▫.20142017-07-10 11:24:51Znanstveno delo66781ISSN: 1365-8050UDK: 519.17OceCobissID: 8089433COBISS_ID: 16916057ISSN pri članku: 1365-8050NUK URN: URN:SI:UM:DK:KDTCHMNMsl