Preprint
Aug 2026
On the damage number of graphs
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 confined to a small set of vertices. The \textit{damage number} of a graph $G$, introduced by Cox and Sanaei in 2019, is the maximum number...
Valentin Gledel, William B. Kinnersley, Balázs Patkós et al.
· 0 citations