A deterministic version of the game of zombies and survivors on graphs

DOI10.1016/j.dam.2016.06.019zbMath1344.05096OpenAlexW2482477387MaRDI QIDQ313777

Mohammad Hasan, M. Dambrine

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.06.019

zbMATH Keywords

graph searchingcops and robberpursuit-evasion on graphs

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

A probabilistic version of the game of zombies and survivors on graphs ⋮ A faster algorithm for cops and robbers ⋮ Limited visibility cops and robber ⋮ On the zombie number of various graph classes ⋮ Zombie number of the Cartesian product of graphs ⋮ Cops and robbers ordinals of cop-win trees ⋮ Comparing the power of cops to zombies in pursuit-evasion games ⋮ A note on deterministic zombies ⋮ How many zombies are needed to catch the survivor on toroidal grids? ⋮ The role of quantum correlations in cop and robber game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• Bridged graphs are cop-win graphs: An algorithmic proof
• A game of cops and robbers played on products of graphs
• On a game of policemen and robber
• Vertex-to-vertex pursuit in a graph
• WHAT IS...Cop Number?