共 50 条
Time-delayed Cops and Robbers
被引:0
|作者:
Clarke, Nancy E.
[1
]
Cox, Danielle
[2
]
Huggan, Melissa A.
[3
]
Huntemann, Svenja
[2
]
Marbach, Trent G.
[4
]
机构:
[1] Acadia Univ, Dept Math & Stat, Wolfville, NS, Canada
[2] Mt St Vincent Univ, Dept Math & Stat, Halifax, NS, Canada
[3] Vancouver Isl Univ, Dept Math, Nanaimo, BC, Canada
[4] Toronto Metropolitan Univ, Dept Math, Toronto, ON, Canada
基金:
加拿大自然科学与工程研究理事会;
关键词:
Pursuit evasion;
Cops and Robber;
Imperfect information;
Time delay;
Graph;
D O I:
10.1016/j.dam.2024.09.030
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
We consider a variation of the Cops and Robbers game in which the cops do not have perfect information; the information they receive regarding the robber's position is delayed by one round. Our parameter of interest is the time-delayed cop number of a graph G , the minimum number of cops that suffice to guarantee a win on G . We present a variety of results on this parameter, including general bounds, and make comparisons to the cop numbers of known related variants of the original game. We have particular interest in graph products, Meyniel-type bounds, and cop density. (c) 2024 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
引用
收藏
页码:394 / 405
页数:12
相关论文