Abstract
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. © 2014 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France.
Author supplied keywords
Cite
CITATION STYLE
APA
Kuziak, D., Peterin, I., & Yero, I. G. (2014). Efficient open domination in graph products. Discrete Mathematics and Theoretical Computer Science, 16(1), 105–120. https://doi.org/10.46298/dmtcs.1267
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free