Abstract
Cops and robber is a two player turn-based game played on a graph where cops try to capture the robber. The cop number of a graph is the minimum number of cops required to capture the robber. We consider two variants of this game, namely cops and attacking robber and lazy cops and robber. In cops and attacking robber version, the robber can attack a cop and remove that cop from the game, whereas in lazy cops and robber version only one cop is allowed to move on a cop’s turn. We investigate the cop number of various grids (planar, cylindrical, toroidal and high dimension) and hypercubes for these variants.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
