We consider a pursuit game on Abelian Cayley digaphs. We obtain a bound for the number of pursuers necessary to catch one evader.
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.
On a pursuit game on Cayley graphs. Author: P. Frankl. P. Frankl. View Profile ... On a pursuit game on Cayley graphs. Mathematics of computing · Discrete ...
Missing: Digraphs. | Show results with:Digraphs.
Feb 27, 1986 · We consider the following game, called cops and robbers. There is a finite, connected, undirected graph G=(V, E), m cops and one robber.
Missing: Digraphs. | Show results with:Digraphs.
A robber and k cops choose starting vertices in a graph and move in alternation from vertex to vertex along the edges of the graph.
On a pursuit game on cayley graphs · Explicit construction of regular graphs without small cycles · Explicit constructions of graphs without short cycles and low ...
A cop captures the robber if the cop resides at the same vertex as the robber, and in this case player C wins the game. Player C has a winning strategy if no ...
Mar 9, 2023 · Abstract. In this article, we study the game of cops and robbers in algebraic graphs. We show that the cop number of the Cayley sum graph of ...
(PDF) Lazy Cops and Robber on Certain Cayley Graph - ResearchGate
www.researchgate.net › ... › Graphs
This variant of the game of Cops and Robber, called Lazy Cops and Robber, was introduced by Offner and Ojakian, who provided bounds for the lazy cop number of ...
Frankl, On a pursuit game on Cayley graphs, Combinatorica 7 (1987), 67–70. [11] A. Frieze, M. Krivelevich, and P. Loh, Variations on Cops and Robbers, J ...