|
|||||
|
|
A note on k-cop-win graphs |
|
| Authors: | Seyyed Aliasghar Hosseini |
| Affiliation: | Department of Mathematics, Simon Fraser University, Burnaby, BC V5A 1S6, Canada |
| Abstract: | The game of Cops and Robbers is a very well known game played on graphs. In this paper we will show that minimum order of a graph that needs cops to guarantee the robber’s capture is increasing in . |
| Keywords: | Cops and Robbers Connectivity |
| 本文献已被 ScienceDirect 等数据库收录！ | |