Abstract:An r-identifying code on a graph G is a set C ⊂ 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.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.