A game of cops and robbers played on products of graphs
โ Scribed by S. Neufeld; R. Nowakowski
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 825 KB
- Volume
- 186
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
The game of cops and robbers is played with a set of 'cops' and a 'robber' who occupy some vertices of a graph. Both sides have perfect information and they move alternately to adjacent vertices. The robber is captured if at least one of the cops occupies the same vertex as the robber. The problem is to determine on a given graph, G, the least number of cops sufficient to capture the robber, called the cop-number, c(G). We investigate this game on three products of graphs: the Cartesian, categorical, and strong products. (~
๐ SIMILAR VOLUMES
## Abstract This study extends product placement research by testing the impact of interactivity on product placement effectiveness. The results suggest that when children cannot interact with the placements in video games, perceptual fluency is the underlying mechanism leading to positive affect.
The number of pebbles used in the black [black-white] pebble game corresponds to the storage requirement of the deterministic [non-deterministic] evaluation of a straight line program. Suppose a distinguished vertex of a directed acyclic graph can be pebbled with k pebbles in the black-white pebble