A Game of Cops and Robbers in Some Networks

Abstract

Cops and Robber games are pursuit-evasion games played on connected graphs. They have been studied extensively and nding the cop number of certain classes of graphs has been one of the major problems in these games. Networks, on the other hand, have been some of the most interest- ing graph classes. In this work, we will investigate the cop number problem of two types of networks, whose cop numbers were not known in general, namely, butterfly networks and solid grid graphs.