Locating dominating codes: Bounds and extremal cardinalities
Combinatorics
2012-05-11 v1 Information Theory
math.IT
Abstract
In this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses should determine a malfunctioning processor or an intruder. Here, we present our more significant contributions on \lambda-codes and \eta-codes concerning concerning bounds, extremal values and realization theorems.
Keywords
Cite
@article{arxiv.1205.2177,
title = {Locating dominating codes: Bounds and extremal cardinalities},
author = {José Cáceres and Carmen Hernando and Mercè Mora and Ignacio M. Pelayo and María Luz Puertas},
journal= {arXiv preprint arXiv:1205.2177},
year = {2012}
}
Comments
6 pages, 6 figures