Skip to Main content Skip to Navigation
Journal articles

Efficient open domination in graph products

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01179224
Contributor : Hélène Lowinger <>
Submitted on : Wednesday, July 22, 2015 - 9:15:37 AM
Last modification on : Thursday, September 7, 2017 - 1:03:41 AM
Long-term archiving on: : Friday, October 23, 2015 - 10:25:40 AM

File

dmtcs-16-1-7.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01179224, version 1

Collections

Citation

Dorota Kuziak, Iztok Peterin, Ismael Gonzalez Yero. Efficient open domination in graph products. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 1 (in progress) (1), pp.105--120. ⟨hal-01179224⟩

Share

Metrics

Record views

206

Files downloads

1466