论文标题
带有禁止子图的定向图上的警察和强盗游戏
The game of Cops and Robbers on directed graphs with forbidden subgraphs
论文作者
论文摘要
传统的警察和强盗游戏在无向图上进行。最近，在导向图上玩的同一游戏引起了越来越多的人的关注。我们知道，如果我们禁止某些子图，我们可以绑定相应的图形类别的COP数字。在本文中，我们在$ \ vec {h} $ - 免费的digraphs上分析了警察和强盗的游戏。但是，它与无向图的情况不同。因此，我们给出了一个新概念（$ \ vec {h}^*$ - 免费），以对无向图的情况获得类似的结论。
The traditional game of cops and robbers is played on undirected graph. Recently, the same game played on directed graph is getting attention by more and more people. We knew that if we forbid some subgraph we can bound the cop number of the corresponding class of graphs. In this paper, we analyze the game of cops and robbers on $\Vec{H}$-free digraphs. However, it is not the same as the case of undirected graph. So we give a new concept ($\Vec{H}^*$-free) to get a similar conclusion about the case of undirected graph.
