Improved Bounds for $r$-Identifying Codes of the Hex Grid

Details Improved Bounds for $r$-Identifying Codes of the Hex Grid Improved Bounds for $r$-Identifying Codes of the Hex Grid

2010-04-08

arxiv.org/abs/1004.1430v1

Mathematics

Combinatorics

12pp

Scientific paper

10.1137/100791610

For any positive integer $r$, an $r$-identifying code on a graph $G$ is a set $C\subset V(G)$ such that for every vertex in $V(G)$, the intersection of the radius-$r$ closed neighborhood with $C$ is nonempty and pairwise distinct. For a finite graph, the density of a code is $|C|/|V(G)|$, which naturally extends to a definition of density in certain infinite graphs which are locally finite. We find a code of density less than $5/(6r)$, which is sparser than the prior best construction which has density approximately $8/(9r)$.

Affiliated with

Also associated with

No associations

Rating

Improved Bounds for $r$-Identifying Codes of the Hex Grid does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved Bounds for $r$-Identifying Codes of the Hex Grid, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Bounds for $r$-Identifying Codes of the Hex Grid will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-220357