On Vertex Identifying Codes For Infinite Lattices
Brendon Stanton · 2011
For any position integer r, an r-identifying code on a graph G is a set C which is a subset of V(G) such that 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 extends naturally to a definition of density on certain infinite graphs which are locally finite. This thesis explores the concept of density on certain infinite graphs, each of which have a representation on an n-dimensional lattice and finds some new bounds for these densities.