scientific article; zbMATH DE number 2159641

zbMath1064.94019MaRDI QIDQ4667607

Sanna Ranto, Tero Laihonen, Iiro S. Honkala

Publication date: 20 April 2005

Full work available at URL: http://www.emis.de/journals/DMTCS/volumes/abstracts/dm060207.abs.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamming spaceIdentifying codesLocating-dominating codes

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Combinatorial codes (94B25)

Related Items (14)

On locating--dominating sets in infinite grids ⋮ On regular and new types of codes for location-domination ⋮ Locating-dominating sets in hypergraphs ⋮ Identifying codes and locating-dominating sets on paths and cycles ⋮ Covering codes of a graph associated with a finite vector space ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid ⋮ Locating sensors in paths and cycles: the case of 2-identifying codes ⋮ Locating-dominating codes in paths ⋮ Liar's domination ⋮ Locating-Domination and Identification ⋮ Open locating-dominating sets in circulant graphs ⋮ Improved lower bound for locating-dominating codes in binary Hamming spaces ⋮ Locating-dominating sets of functigraphs ⋮ Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs

This page was built for publication: