5 citations · 9 across the 8 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.CO2011★ 2 cited
The Petersen graph is the smallest 3-cop-win graph
Andrew Beveridge, Paolo Codenotti, Aaron Maurer +2
In the game of \emph{cops and robbers} on a graph , cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the…
math.PR2011
On the Mixing Time of Geographical Threshold Graphs
Andrew Beveridge, Milan Bradonjić
We study the mixing time of random graphs in the -dimensional toric unit cube generated by the geographical threshold graph (GTG) model, a generalization of random geo…
math.CO2011
Cops and Robbers on Geometric Graphs
Andrew Beveridge, Andrzej Dudek, Alan Frieze +1
Cops and robbers is a turn-based pursuit game played on a graph . One robber is pursued by a set of cops. In each round, these agents move between vertices along the edges of th…