On a pursuit game on Cayley digraphs (Q1100216): Difference between revisions

The author considers a pursuit game on a graph G which was previously studied by A. Quilliot, M. Aigner and M. Fromme, and others; for the rules see e.g. [\textit{M. Aigner} and \textit{M. Fromme}, Discrete Appl. Math. 8, 1-11 (1984; Zbl 0539.05052)]. The main result is that \(\lceil 3k/4\rceil\) pursuers can catch the evader when G is a connected Cayley graph of degree k defined on an Abelian group.