2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2017
Hyperopic Cops and Robbers
A. Bonato, N. E. Clarke, D. Cox +3
We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the…
math.CO2017
Optimal Graphs for Independence and -Independence Polynomials
J. I. Brown, D. Cox
The independence polynomial of a finite graph is the generating function for the sequence of the number of independent sets of each cardinality. We investigate whether…
cs.DM2017★ 2 cited
Limited Visibility Cops and Robbers
N. E. Clarke, D. Cox, C. Duffy +3
We consider a variation of the Cops and Robber game where the cops can only see the robber when the distance between them is at most a fixed parameter . We consider the basic…