Brendon Stanton

most citedImproved Bounds for

r

-Identifying Codes of the Hex Grid

6 citations · 6 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2010

Lower bounds for identifying codes in some infinite grids

Ryan Martin, Brendon Stanton

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 an…

math.CO2010★ 6 cited

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

Brendon Stanton

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 neighb…

Lower bounds for identifying codes in some infinite grids

Improved Bounds for r-Identifying Codes of the Hex Grid

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