Geodesic
On Stronger Types of Locating-dominating Codes
Discrete mathematics & theoretical computer science, ICGT 2018, Tome 21 (2019) no. 1.

Voir la notice de l'article provenant de la source Episciences

Locating-dominating codes in a graph find their application in sensor networks and have been studied extensively over the years. A locating-dominating code can locate one object in a sensor network, but if there is more than one object, it may lead to false conclusions. In this paper, we consider stronger types of locating-dominating codes which can locate one object and detect if there are multiple objects. We study the properties of these codes and provide bounds on the smallest possible size of these codes, for example, with the aid of the Dilworth number and Sperner families. Moreover, these codes are studied in trees and Cartesian products of graphs. We also give the complete realization theorems for the coexistence of the smallest possible size of these codes and the optimal locating-dominating codes in a graph. 
@article{DMTCS_2019_21_1_a3,
     author = {Junnila, Ville and Laihonen, Tero and Lehtil\"a, Tuomo and Puertas, Mar{\'\i}a Luz},
     title = {On {Stronger} {Types} of {Locating-dominating} {Codes}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {21},
     number = {1},
     year = {2019},
     doi = {10.23638/DMTCS-21-1-1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-1-1/}
}
TY  - JOUR
AU  - Junnila, Ville
AU  - Laihonen, Tero
AU  - Lehtilä, Tuomo
AU  - Puertas, María Luz
TI  - On Stronger Types of Locating-dominating Codes
JO  - Discrete mathematics & theoretical computer science
PY  - 2019
VL  - 21
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-1-1/
DO  - 10.23638/DMTCS-21-1-1
LA  - en
ID  - DMTCS_2019_21_1_a3
ER  - 
%0 Journal Article
%A Junnila, Ville
%A Laihonen, Tero
%A Lehtilä, Tuomo
%A Puertas, María Luz
%T On Stronger Types of Locating-dominating Codes
%J Discrete mathematics & theoretical computer science
%D 2019
%V 21
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-1-1/
%R 10.23638/DMTCS-21-1-1
%G en
%F DMTCS_2019_21_1_a3
Junnila, Ville; Laihonen, Tero; Lehtilä, Tuomo; Puertas, María Luz. On Stronger Types of Locating-dominating Codes. Discrete mathematics & theoretical computer science, ICGT 2018, Tome 21 (2019) no. 1. doi : 10.23638/DMTCS-21-1-1. http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-1-1/

Cité par Sources :