Efficient open domination in graph products
Estadísticas
Métricas y Citas
Exportar a
Metadatos
Mostrar el registro completo del ítem
Fecha
2014-03-01Fuente
Discrete Mathematics and Theoretical Computer Science - 2014, Vol.16 n.1 pp. 105–120.Resumen
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
Colecciones
- Artículos Científicos [11977]
- Articulos Científicos Est. I.O. [361]
- Articulos Científicos Matemáticas [517]
Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional