The Game of Zombies and Survivors on the Cartesian Products of Trees

06/12/2018
by   Shannon L. Fitzpatrick, et al.
0

We consider the game of Zombies and Survivors as introduced by Fitzpatrick, Howell, Messinger and Pike (2016) This is a variation of the game Cops and Robber where the zombies (in the cops' role) are of limited intelligence and will always choose to move closer to a survivor (who takes on the robber's role). The zombie number of a graph is defined to be the minimum number of zombies required to guarantee the capture of a survivor on the graph. In this paper, we show that the zombie number of the Cartesian product of n non-trivial trees is exactly 2n/3 . This settles a conjecture by Fitzpatrick et. al. (2016) that this is the zombie number for the n-dimensional hypercube. In proving this result, we also discuss other variations of Cops and Robber involving active and flexible players.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/08/2020

A note on deterministic zombies

"Zombies and Survivor" is a variant of the well-studied game of "Cops an...
research
03/25/2019

Cop throttling number: Bounds, values, and variants

The cop throttling number th_c(G) of a graph G for the game of Cops and ...
research
02/10/2020

Edge colouring Game on Trees with maximum degree Δ=4

Consider the following game. We are given a tree T and two players (say)...
research
08/23/2017

Limited Visibility Cops and Robbers

We consider a variation of the Cops and Robber game where the cops can o...
research
10/17/2021

Spy game: FPT-algorithm, hardness and graph products

In the (s,d)-spy game over a graph G, k guards and one spy occupy some v...
research
01/25/2019

A Sublinear Bound on the Cop Throttling Number of a Graph

We provide a sublinear bound on the cop throttling number of a connected...
research
07/15/2021

A note on hyperopic cops and robber

We explore a variant of the game of Cops and Robber introduced by Bonato...

Please sign up or login with your details

Forgot password? Click here to reset