Abstract

The game of Cops and Robbers is a very well known game played on graphs. In this paper we will show that minimum order of a graph that needs k cops to guarantee the robber’s capture is increasing in k.

Full Text
Published version (Free)

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 call