Exact values for three domination-like problems in circular and infinite grid graphs of small height - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

Exact values for three domination-like problems in circular and infinite grid graphs of small height

Résumé

In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height. We provide an alternate proof for already known results, as well as new results. These were obtained by a computer search based on a generic framework, that we developed earlier, for the search of a minimum labeling satisfying a pseudo-d-local property in rotagraphs.
Fichier principal
Vignette du fichier
BouDarMonPreRevised.pdf (258.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01569881 , version 1 (02-08-2017)
hal-01569881 , version 2 (14-02-2019)
hal-01569881 , version 3 (30-04-2019)

Identifiants

Citer

Marwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann. Exact values for three domination-like problems in circular and infinite grid graphs of small height. 2017. ⟨hal-01569881v2⟩
300 Consultations
896 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More