Lower bounds for identifying codes in some infinite grids

Details Lower bounds for identifying codes in some infinite grids Lower bounds for identifying codes in some infinite grids

2010-04-19

arxiv.org/abs/1004.3281v1

Mathematics

Combinatorics

18pp

Scientific paper

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 unique. On 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 present new lower bounds for densities of codes for some small values of $r$ in both the square and hexagonal grids.

Affiliated with

Also associated with

No associations

Rating

Lower bounds for identifying codes in some infinite grids 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 Lower bounds for identifying codes in some infinite grids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds for identifying codes in some infinite grids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-60380