DMCA
An Optimal Edge-Robust Identifying Code in the Triangular Lattice (2004)
by
Iiro Honkala
| Venue: | ANNALS OF COMBINATORICS |
| Citations: | 6 - 0 self |
BibTeX
@MISC{Honkala04anoptimal,
author = {Iiro Honkala},
title = { An Optimal Edge-Robust Identifying Code in the Triangular Lattice},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
A subset C of vertices in an undirected graph G = (V; E) is called a 1-identifying code if the sets I(v) = fu 2C: d(u; v) 1g, v 2 V, are non-empty and no two of them are the same set. A 1-identifying code C is called 1-edge-robust 1-identifying if it is 1-identifying in every graph G1 obtained from G by deleting or adding one edge. It is shown that the optimal density of a 1-edge-robust 1-identifying code in the innite triangular lattice is 3/7.
