The capture time of grids

15Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We consider the game of cops and robber played on the Cartesian product of two trees. Assuming the players play perfectly, it is shown that if there are two cops in the game, then the length of the game (known as the 2-capture time of the graph) is equal to half the diameter of the graph. In particular, the 2-capture time of the m×n grid is proved to be ⌊m+n2⌋-1. © 2010 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Mehrabian, A. (2011). The capture time of grids. Discrete Mathematics, 311(1), 102–105. https://doi.org/10.1016/j.disc.2010.10.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free