Efficient open domination in graph productsArticleAuthors: Dorota Kuziak
1; Iztok Peterin
2; Ismael Gonzalez Yero
3
0000-0001-9660-3284##0000-0002-1990-6967##NULL
Dorota Kuziak;Iztok Peterin;Ismael Gonzalez Yero
- 1 Departament d'Enginyeria Informàtica i Matemàtiques
- 2 Faculty of Electrical Engineering and Computer Science
- 3 DEPARTAMENTO DE MATEMATICAS
Graph Theory
[en]
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 K2.
Volume: Vol. 16 no. 1
Section: Graph Theory
Published on: March 1, 2014
Imported on: October 9, 2013
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] Discrete Mathematics, Graph Theory, Domination, Graph Products