Cops that surround a robber
Andrea C. Burgess, Rosalind A. Cameron, Nancy E. Clarke, Peter, Danziger, Stephen Finbow, Caleb W. Jones, David A. Pike

TL;DR
This paper introduces the Surrounding Cops and Robbers game on graphs, where cops aim to occupy all neighbors of a robber, and studies the surrounding cop number across various graph classes.
Contribution
It defines the surrounding cop number and provides bounds and exact values for different graph classes, expanding understanding of pursuit-evasion dynamics.
Findings
Bounds on the surrounding cop number for general graphs
Exact values for specific graph classes such as product graphs and Petersen graphs
Insights into how graph structure influences pursuit strategies
Abstract
We introduce the game of Surrounding Cops and Robbers on a graph, as a variant of the original game of Cops and Robbers. In contrast to the original game in which the cops win by occupying the same vertex as the robber, they now win by occupying each of the robber's neighbouring vertices. We denote by the {\em surrounding cop number} of , namely the least number of cops required to surround a robber in the graph . We present a number of results regarding this parameter, including general bounds as well as exact values for several classes of graphs. Particular classes of interest include product graphs, graphs arising from combinatorial designs, and generalised Petersen graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
