Abstract
The game cops and robbers is considered on Cayley graphs of abelian groups. It is proved that if the graph has degreed, then [(d+1)/2] cops are sufficient to catch one robber. This bound is often best possible.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Aigner andM. Fromme, A game of cops and robbers,Disc. Appl. Math.,8 (1984), 1–12.
T. Andreae, Note on a pursuit game played on graphs,Disc. Appl. Math.,9 (1984), 111–15.
T. Andreae, On a pursuit game played on graphs for which a minor is excluded,J. Combinatorial Th. B, to appear.
P. Frankl, Cops and Robbers in graphs with large girth and Cayley graphs,Discrete Appl. Math., in press.
Y. O. Hamidoune, On a pursuit game on Cayley digraphs,European J. Comb., to appear.
W. Imrich, Explicit construction of regular graphs without small cycles,Combinatorica,4 (1984), 53–59.
M. Maamoun andH. Meyniel, On a game of policemen and robber,Discrete Appl. Math., to appear.
G. A. Margulis, Explicit construction of graphs without short cycles and low density codes,Combinatorica,2 (1982), 71–78.
A. Quilliot,Jeux Positionnels et Propriété de Helly, Thèse de 3ème Cycle, Juin 1978, Paris VI.
A. Quilliot, Discrete pursuit games,Proc. of the 13th Conf. on Graphs and Combinatorics at Boca Raton, Congressus Neumerantium,38 (1983), 227–241.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Frankl, P. On a pursuit game on cayley graphs. Combinatorica 7, 67–70 (1987). https://doi.org/10.1007/BF02579201
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02579201