Abstract
The lazy cop number is the minimum number of cops needed for the cops to have a winning strategy in the game of Cops and Robbers where at most one cop may move in any round. This variant of the game of Cops and Robbers, called Lazy Cops and Robbers, was introduced by Offner and Ojakian, who provided bounds for the lazy cop number of the hypercube. In this paper, we are interested in the game of Lazy Cops and Robbers on generalized hypercubes. Generalizing existing methods, we will give asymptotic upper and lower bounds on the lazy cop number of the generalized hypercube.
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.
