6 citations · 10 across the 6 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
math.CO2010★ 4 cited
Vertex identifying codes for the n-dimensional lattice
Brendon Stanton
An -identifying code on a graph is a set such that for every vertex in , the intersection of the radius- closed neighborhood with is nonempty an…
math.CO2010
Lower bounds for identifying codes in some infinite grids
Ryan Martin, Brendon Stanton
An -identifying code on a graph is a set such that for every vertex in , the intersection of the radius- closed neighborhood with is nonempty an…
math.CO2010★ 6 cited
Improved Bounds for -Identifying Codes of the Hex Grid
Brendon Stanton
For any positive integer , an -identifying code on a graph is a set such that for every vertex in , the intersection of the radius- closed neighb…