Locating-dominating codes: Bounds and extremal cardinalities
Rights accessRestricted access - publisher's policy
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.