On the damage number of graphs

Valentin Gledel, William B. Kinnersley, Balázs Patkós +1

We study a variant of Cops and Robbers in which the robber attempts to visit as many vertices of the graph as possible without being captured, while the cop aims to keep the robber…