On identification in the triangular grid

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:
Journal of Combinatorial Theory Series B
Year:
2004

Citing 7
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
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

Theoretical Computer Science
On a new class of codes for identifying vertices in graphs

IEEE Transactions on Information Theory
Identifying and locating-dominating codes: NP-completeness results for directed graphs

IEEE Transactions on Information Theory

On a new class of identifying codes in graphs

Information Processing Letters
On robust identification in the square and king grids

Discrete Applied Mathematics
Adaptive identification in graphs

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

A subset C of vertices in a connected graph G = (V, E) is called (r, ≤ l)-identifying if for all subsets L ⊆ V of size at most l, the sets I(L), consisting of all the codewords which are within graphic distance r from at least one element in L. are different. It is proved that the minimum possible density of a (1, ≤2)-identifying code in the triangular grid is 9/16.