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

图的Cop Throttling数的一个次线性界

A Sublinear Bound on the Cop Throttling Number of a Graph

Anthony Bonato, Sean English

摘要:

本文给出了连通图的cop节流数的一个次线性界。与图搜索游戏Cops and Robbers相关,警察节流数,写作$\mathrm{th}_c(G)$,由$\mathrm{th}_c(G)=\min_k\{k+\mathrm{capt}_k(G)\}$给出,其中$\mathrm{capt}_k(G)$是$k$ -捕获时间,或在图$G$上具有$k$警察的警察和强盗游戏的长度,假设两个玩家都最佳地玩。对于连通图的cop节流数,目前还没有一个普遍的次线性界。对于Breen等人提出的一个问题,我们证明了$\mathrm{th}_c(G)\leq \frac{(2+o(1))n\sqrt{W(\log(n))}}{\sqrt{\log(n)}},$,其中$W=W(x)$是Lambert W函数。

英文摘要:

We provide a sublinear bound on the cop throttling number of a connected graph. Related to the graph searching game Cops and Robbers, the cop throttling number, written $\mathrm{th}_c(G)$, is given by $\mathrm{th}_c(G)=\min_k\{k+\mathrm{capt}_k(G)\}$, in which $\mathrm{capt}_k(G)$ is the $k$-capture time, or the length of a game of Cops and Robbers with $k$ cops on the graph $G$, assuming both players play optimally. No general sublinear bound was known on the cop throttling number of a connected graph. Towards a question asked by Breen et al., we prove that $\mathrm{th}_c(G)\leq \frac{(2+o(1))n\sqrt{W(\log(n))}}{\sqrt{\log(n)}},$ where $W=W(x)$ is the Lambert W function.

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

↑