Lazy cops and robber on certain cayley graph
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 provide...
Saved in:
Main Authors: | Sim, Kai An, Tan, Ta Sheng, Wong, Kok Bin |
---|---|
Format: | Article |
Published: |
Penerbit UTM Press
2022
|
Subjects: | |
Online Access: | http://eprints.um.edu.my/43499/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the minimum order of 4-lazy cops-win graphs
by: Sim, Kai An, et al.
Published: (2018) -
Lazy cop number and other related graph parameters / Sim Kai An
by: Sim , Kai An
Published: (2018) -
On eigenvalues of certain cayley graphs / Terry Lau Shue Chien
by: Terry, Lau Shue Chien
Published: (2016) -
On the Burning Number of Generalized Petersen Graphs
by: Sim, Kai An, et al.
Published: (2018) -
On the ramsey numbers for the tree graphs versus certain generalised wheel graphs
by: Chng, Zhi Yee, et al.
Published: (2021)