• 대한수학회보
• /
• 제57권1호
• /
• pp.127-131
• /
• 2020

We discuss two unrelated topics regarding Cops and Robbers, a well-known pursuit-evasion game played on a simple graph. First, we address a recent question of Breen et al. and prove the PSPACE-completeness of the cop throttling number, that is, the minimal possible sum of the number k of cops and the number capt(k) of moves that the robber can survive against k cops under the optimal play of both sides. Secondly, we revisit a teleporting version of the game due to Wagner; we disprove one of his conjectures and suggest a new related research problem.

• 대한수학회보
• /
• 제55권6호
• /
• pp.1667-1690
• /
• 2018

We consider the minimum order of a graph G with a given lazy cop number $c_L(G)$. Sullivan, Townsend and Werzanski [7] showed that the minimum order of a connected graph with lazy cop number 3 is 9 and $k_3{\square}k_3$ is the unique graph on nine vertices which requires three lazy cops. They conjectured that for a graph G on n vertices with ${\Delta}(G){\geq}n-k^2$, $c_L(G){\leq}k$. We proved that the conjecture is true for k = 4. Furthermore, we showed that the Petersen graph is the unique connected graph G on 10 vertices with ${\Delta}(G){\leq}3$ having lazy cop number 3 and the minimum order of a connected graph with lazy cop number 4 is 16.