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

周期图的警察数

Cop numbers of periodic graphs

Jean-Lou De Carufel, Paola Flocchini, Nicola Santoro, Frédéric Simard

AI总结:

本文研究周期图警察数与其足迹警察数的关系,通过最小图例子和多组构造揭示二者差异,并由足迹树宽等性质给出周期图警察数上界。

摘要:

周期为 $p$ 的周期图 ${\cal G}=(G_0,G_1,G_2,\dots)$ 是图的无限周期序列 $G_i=G_{i+p}=(V,E_i)$,其中 $i\geq 0$。图 $G=(V,\cup_i E_i)$ 被称为 ${\cal G}$ 的足迹。近来,警察与强盗游戏进行的场所已从图扩展到周期图;在这种情况下,警察数同样是足以捕获强盗的最少警察数量。我们研究周期图 ${\cal G}$ 的警察数 $c({\cal G})$ 与其足迹 $G$ 的警察数 $c(G)$ 之间的联系和区别,并建立若干事实。例如,我们证明满足 $c({\cal G})=3$ 的最小周期图至多有 $8$ 个节点;相比之下,满足 $c(G)=3$ 的最小图 $G$ 有 $10$ 个节点。我们通过构造多个例子推进这一研究,这些例子展示了周期图 ${\cal G}$、子图 $G_i$ 及其足迹 $G$ 的警察数之间可能只有松散的联系。基于这些结果,我们利用足迹的树宽等性质,推导出周期图警察数的上界。

英文摘要:

A \emph{periodic graph} ${\cal G}=(G_0, G_1, G_2, \dots)$ with period $p$ is an infinite periodic sequence of graphs $G_i = G_{i + p} = (V,E_i)$, where $i \geq 0$. The graph $G=(V,\cup_i E_i)$ is called the footprint of ${\cal G}$. Recently, the arena where the Cops and Robber game is played has been extended from a graph to a periodic graph; in this case, the \emph{cop number} is also the minimum number of cops sufficient for capturing the robber. We study the connections and distinctions between the cop number $c({\cal G})$ of a periodic graph ${\cal G}$ and the cop number $c(G)$ of its footprint $G$ and establish several facts. For instance, we show that the smallest periodic graph with $c({\cal G}) = 3$ has at most $8$ nodes; in contrast, the smallest graph $G$ with $c(G) = 3$ has $10$ nodes. We push this investigation by generating multiple examples showing how the cop numbers of a periodic graph ${\cal G}$, the subgraphs $G_i$ and its footprint $G$ can be loosely tied. Based on these results, we derive upper bounds on the cop number of a periodic graph from properties of its footprint such as its treewidth.

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

↑