Efficient open domination in graph products - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2014

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.
Fichier principal
Vignette du fichier
dmtcs-16-1-7.pdf (4 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01179224 , version 1 (22-07-2015)

Identifiers

Cite

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

Collections

TDS-MACS
108 View
1195 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More