On a pursuit game on Cayley digraphs (Q1100216): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A game of cops and robbers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note on a pursuit game played on graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Explicit constructions of graphs without short cycles and low density codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3693317 / rank | |||
Normal rank | |||
Revision as of 15:23, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a pursuit game on Cayley digraphs |
scientific article |
Statements
On a pursuit game on Cayley digraphs (English)
0 references
1987
0 references
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.
0 references
pursuit game
0 references
connected Cayley graph
0 references
Abelian group
0 references
