.png){kind=icon}
Return
Surrounding an Active Robber
.png){kind=icon}
PRE
AI
DOI：10.1007/s44007-026-00206-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We look at an active version of Surrounding Cops and Robber in which the robber must never remain on their current vertex. Our parameter of interest is the active surrounding number of a graph: the minimum number of cops that suffice to surround the robber on that graph. We find exact values of our parameter for some graph families, establish bounds for others, and also explore some particular graph families for which the active surrounding number differs from the analogous parameters for several related variants.
Keywords:
Pursuit-evasion on graphs
Cops and Robber
Copnumber
Surrounding copnumber
Games on graphs
Journal
M
IF:
0
Papers:
42
Citations:
0
Organization
View more organizations
Cited Papers
No cited papers available