Lazy cops and robber on certain cayley graph
Document Type
Article
Publication Date
3-1-2022
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 Robber where at most one cop may move in any one round. This variant of the game of Cops and Robber, called Lazy Cops and Robber, was introduced by Offner and Ojakian, who provided bounds for the lazy cop number of hypercubes. In this paper, we are interested in the game of Lazy Cops and Robber on a Cayley graph of n copies of Z m+1f> © Copyright Sim et al.
Keywords
Cops and robber, Hypercubes, Vertex-pursuit games
Divisions
MathematicalSciences
Funders
Sunway University [Grant No: GRTIN-RSF-SMS-DPAM-03-2020],Ministry of Education, Malaysia [Grant No: FRGS/1/2020/STG06/SYUC/03/1]
Publication Title
Malaysian Journal of Fundamental and Applied Sciences
Volume
18
Issue
2
Publisher
Penerbit UTM Press