arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.10894math.COcs.DM
收藏

图的损伤节流数

The damage throttling number of a graph

Joshua Carlson, Robin Eagleton, Jesse Geneson, John Petrucci, Carolyn Reinhart, Preetul Sen

摘要:

图的cop节流数,由Breen等人在2018年引入,优化了在警察和强盗的游戏中使用的警察数量和抓住强盗所需的回合数之间的平衡。在2019年,Cox和Sanaei研究了Cops and Robbers的一个变体,其中强盗试图占据(或损坏)尽可能多的顶点,而警察试图将这种损坏降至最低。在他们的论文中,他们研究了在给定的图$G$上进行的所有游戏中,强盗损坏的顶点的最小数量,称为$G$的损坏数。我们引入的自然参数称为损坏节流数的图,表示为$\operatorname{th}_d(G)$,它优化之间的平衡使用的警察的数量和损坏的顶点数的图。为此,我们形式化的定义$k$ -损害数,它扩展的损害数与$k$警察玩的游戏。我们发现,损害节流和铜节流共享许多属性,但他们表现出有趣的差异。我们证明了损伤节流数紧上有界于cop节流数之小于。给出了该界中紧性的无限族例子和非例子。我们还发现了一个无限族的连通图$G$的顺序$n$,其中$\operatorname{th}_d(G) = Ω(n^{2/3})$。

英文摘要:

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, denoted $\operatorname{th}_d(G)$, 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. We also find an infinite family of connected graphs $G$ of order $n$ for which $\operatorname{th}_d(G) = Ω(n^{2/3})$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑