Bouznif, Marwane and Darlay, Julien and Moncel, Julien and Preissmann, Myriam - Exact values for three domination-like problems in circular and infinite grid graphs of small height

dmtcs:3843 - Discrete Mathematics & Theoretical Computer Science, May 16, 2019, Vol. 21 no. 3
Exact values for three domination-like problems in circular and infinite grid graphs of small height

Authors: Bouznif, Marwane and Darlay, Julien and Moncel, Julien and Preissmann, Myriam

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.


DOI : 10.23638/DMTCS-21-3-12
Volume: Vol. 21 no. 3
Section: Graph Theory
Published on: May 16, 2019
Submitted on: August 4, 2017
Keywords: graph algorithm,identifying code,locating-dominating code,locating-total-dominating code,grid,ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory,ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms,ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.1: Graph labeling,ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.4: Path and circuit problems,[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Consultation statistics

This page has been seen 197 times.
This article's PDF has been downloaded 92 times.