Cover Image

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Sim, Kai An, Tan, Ta Sheng, Wong, Kok Bin
Format: Article
Published: Penerbit UTM Press 2022
Subjects:
Q Science (General)
T Technology (General)
Online Access:http://eprints.um.edu.my/43499/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.um.eprints.43499
record_format eprints
spelling my.um.eprints.434992023-10-31T04:05:39Z http://eprints.um.edu.my/43499/ Lazy cops and robber on certain cayley graph Sim, Kai An Tan, Ta Sheng Wong, Kok Bin Q Science (General) T Technology (General) 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. Penerbit UTM Press 2022-03 Article PeerReviewed 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 <https://doi.org/10.11113/mjfas.v18n2.2235>. 10.11113/mjfas.v18n2.2235
institution Universiti Malaya
building UM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaya
content_source UM Research Repository
url_provider http://eprints.um.edu.my/
topic Q Science (General)
T Technology (General)
spellingShingle Q Science (General)
T Technology (General)
Sim, Kai An
Tan, Ta Sheng
Wong, Kok Bin
Lazy cops and robber on certain cayley graph
description 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.
format Article
author Sim, Kai An
Tan, Ta Sheng
Wong, Kok Bin
author_facet Sim, Kai An
Tan, Ta Sheng
Wong, Kok Bin
author_sort Sim, Kai An
title Lazy cops and robber on certain cayley graph
title_short Lazy cops and robber on certain cayley graph
title_full Lazy cops and robber on certain cayley graph
title_fullStr Lazy cops and robber on certain cayley graph
title_full_unstemmed Lazy cops and robber on certain cayley graph
title_sort lazy cops and robber on certain cayley graph
publisher Penerbit UTM Press
publishDate 2022
url http://eprints.um.edu.my/43499/
_version_ 1781704708005560320
score 13.15806

Similar Items