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

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Mathematics and Theoretical Computer Science Ročník 21 no. 3; číslo Graph Theory; s. COV2 - 21
Hlavní autori: Bouznif, Marwane, Darlay, Julien, Moncel, Julien, Preissmann, Myriam
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Nancy DMTCS 01.07.2019
Discrete Mathematics & Theoretical Computer Science
Predmet:
[info.info-dm]computer science [cs]/discrete mathematics [cs.dm]
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
Algorithms
Codes
Coding theory
Computer Science
Discrete Mathematics
graph algorithm
Graph theory
Graphs
grid
identifying code
locating-dominating code
locating-total-dominating code
Mathematical research
France
locating-dominating code
locating-total-dominating code
identifying code
graph algorithm
grid
ISSN:1365-8050, 1462-7264, 1365-8050
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.23638/DMTCS-21-3-12