The damage throttling number of a graph
AUSTRALASIAN JOURNAL OF COMBINATORICS(2020)
摘要
The cop throttling number of a graph, introduced in 2018 by Breen et al., optimizes the balance between the number of cops used and the number of rounds required to catch the robber in a game of Cops and Robbers. In 2019, Cox and Sanaei studied a variant of Cops and Robbers in which the robber tries to occupy (or damage) as many vertices as possible and the cop tries to minimize this damage. In their paper, they study the minimum number of vertices damaged by the robber over all games played on a given graph $G$, called the damage number of $G$. We introduce the natural parameter called the damage throttling number of a graph, which optimizes the balance between the number of cops used and the number of vertices damaged in the graph. To this end, we formalize the definition of $k$-damage number, which extends the damage number to games played with $k$ cops. We show that damage throttling and cop throttling share many properties, yet they exhibit interesting differences. We prove that the damage throttling number is tightly bounded above by one less than the cop throttling number. Infinite families of examples and non-examples of tightness in this bound are given.
更多查看译文
关键词
graph,damage
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要