|
|||||
|
|
On a pursuit game on cayley graphs |
|
| Authors: | Peter Frankl |
| Affiliation: | (1) C. N. R. S., E. R. Combinatoire, 54 Bd Raspail, 75006 Paris, France |
| 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. |
| Keywords: | 05 C 25 |
| 本文献已被 SpringerLink 等数据库收录！ | |