On a pursuit game on Cayley graphs (Q1090336)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a pursuit game on Cayley graphs |
scientific article; zbMATH DE number 4006292
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a pursuit game on Cayley graphs |
scientific article; zbMATH DE number 4006292 |
Statements
On a pursuit game on Cayley graphs (English)
0 references
1987
0 references
The game cops and robbers is considered on Cayley graphs of Abelian groups. It is proved that if the graph has degree d, then \(\lceil (d+1)/2\rceil\) cops are sufficient to catch one robber. This bound is often best possible.
0 references
cops and robbers
0 references
Cayley graphs
0 references
Abelian groups
0 references
