Sim, Kai An and Tan, Ta Sheng and Wong, Kok Bin (2022) Lazy cops and robber on certain cayley graph. Malaysian Journal of Fundamental and Applied Sciences, 18 (2). 148 -156. ISSN 2289-599X, DOI https://doi.org/10.11113/mjfas.v18n2.2235.
Full text not available from this repository.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.
| Item Type: | Article |
|---|---|
| Funders: | Sunway University [Grant No: GRTIN-RSF-SMS-DPAM-03-2020], Ministry of Education, Malaysia [Grant No: FRGS/1/2020/STG06/SYUC/03/1] |
| Uncontrolled Keywords: | Cops and robber; Hypercubes; Vertex-pursuit games |
| Subjects: | Q Science > Q Science (General) T Technology > T Technology (General) |
| Divisions: | Faculty of Science > Institute of Mathematical Sciences |
| Depositing User: | Ms. Juhaida Abd Rahim |
| Date Deposited: | 31 Oct 2023 04:05 |
| Last Modified: | 31 Oct 2023 04:05 |
| URI: | http://eprints.um.edu.my/id/eprint/43499 |
Actions (login required)
 |
View Item |
