Locating-dominating codes: Bounds and extremal cardinalities
View/Open
1-s2.0-S0096300313006085-main.pdf (713,6Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/20810
Document typeArticle
Defense date2013-09-01
Rights accessRestricted access - publisher's policy
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
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 contributions on λ-codes and η-codes concerning bounds, extremal values and realization theorems.
CitationCáceres, J. [et al.]. Locating-dominating codes: Bounds and extremal cardinalities. "Applied mathematics and computation", 01 Setembre 2013, vol. 220, p. 38-45.
ISSN0096-3003
Publisher versionhttp://dx.doi.org/10.1016/j.amc.2013.05.060
Files | Description | Size | Format | View |
---|---|---|---|---|
1-s2.0-S0096300313006085-main.pdf | 713,6Kb | Restricted access |