Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Locating-dominating codes: Bounds and extremal cardinalities

Autor
Cáceres, J.; Hernando, M.; Mora, M.; Pelayo, I. M.; Puertas, M. Luz
Tipus d'activitat
Article en revista
Revista
Applied mathematics and computation
Data de publicació
2013-09-01
Volum
220
Pàgina inicial
38
Pàgina final
45
Repositori
http://hdl.handle.net/2117/20810 Obrir en finestra nova
URL
http://dx.doi.org/10.1016/j.amc.2013.05.060 Obrir en finestra nova
Resum
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 contributions on ¿-codes and ¿-codes concerning bounds, extremal values and realization theorems In this work, two types of codes such that they both dominate and locate the vertices of a graph are...
Citació
Cáceres, J. [et al.]. Locating-dominating codes: Bounds and extremal cardinalities. "Applied mathematics and computation", 01 Setembre 2013, vol. 220, p. 38-45.
Paraules clau
Codes on graphs, Covering codes, Graph theory, Locating dominating codes, Network problems
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry

Participants