Lazy Cops and Robber on Certain Cayley Graph

Autor:	Sim, Kai An, Ta Sheng Tan, Wong, Kok Bin
Rok vydání:	2022
Předmět:	General Mathematics General Physics and Astronomy General Chemistry General Agricultural and Biological Sciences General Biochemistry Genetics and Molecular Biology
Zdroj:	Web of Science
ISSN:	2289-599X 2289-5981
DOI:	10.11113/mjfas.v18n2.2235
Popis:	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 Zm+1.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::712bf94c7592bef6d53a4e4039545c21 https://doi.org/10.11113/mjfas.v18n2.2235 Zobrazit plný text záznamu