Lazy cops and robbers on generalized hypercubes
| Autor: | Kok Bin Wong, Kai An Sim, Ta Sheng Tan |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
021103 operations research 0211 other engineering and technologies 0102 computer and information sciences 02 engineering and technology Software_PROGRAMMINGTECHNIQUES 01 natural sciences Upper and lower bounds Theoretical Computer Science Combinatorics 010201 computation theory & mathematics Discrete Mathematics and Combinatorics Hypercube Mathematics |
| Zdroj: | Discrete Mathematics. 340:1693-1704 |
| ISSN: | 0012-365X |
| DOI: | 10.1016/j.disc.2016.09.031 |
| 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 Robbers where at most one cop may move in any round. This variant of the game of Cops and Robbers, called Lazy Cops and Robbers, was introduced by Offner and Ojakian, who provided bounds for the lazy cop number of the hypercube. In this paper, we are interested in the game of Lazy Cops and Robbers on generalized hypercubes. Generalizing existing methods, we will give asymptotic upper and lower bounds on the lazy cop number of the generalized hypercube. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect