On a new class of identifying codes in graphs

Authors:
Iiro Honkala;Tero Laihonen
Affiliations:
Department of Mathematics, University of Turku, 20014 Turku, Finland;Department of Mathematics, University of Turku, 20014 Turku, Finland
Venue:
Information Processing Letters
Year:
2007

Citing 10
Cited 3

On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals

IEEE Transactions on Computers
Bounds for Codes Identifying Vertices in the Hexagonal Grid

SIAM Journal on Discrete Mathematics
Fault-tolerant locating-dominating sets

Discrete Mathematics
On the density of identifying codes in the square lattice

Journal of Combinatorial Theory Series B
On Identifying Codes in the Triangular and Square Grids

SIAM Journal on Computing
On identification in the triangular grid

Journal of Combinatorial Theory Series B
Exact Minimum Density of Codes Identifying Vertices in the Square Grid

SIAM Journal on Discrete Mathematics
On a new class of codes for identifying vertices in graphs

IEEE Transactions on Information Theory
Sequences of optimal identifying codes

IEEE Transactions on Information Theory
Two families of optimal identifying codes in binary Hamming spaces

IEEE Transactions on Information Theory

On robust identification in the square and king grids

Discrete Applied Mathematics
Identification in Z2 using Euclidean balls

Discrete Applied Mathematics
Optimal identifying codes in the infinite 3-dimensional king grid

European Journal of Combinatorics

Quantified Score

Hi-index	0.89

Visualization

Abstract

Assume that G=(V,E) is an undirected graph, and C@?V. For every v@?V, we denote I"r(v)={u@?C:d(u,v)=F^', then both F and F^' have size at least l+1. Such codes can be used in the maintenance of multiprocessor architectures. We consider the cases when G is the infinite square or king grid, infinite triangular lattice or hexagonal mesh, or a binary hypercube.