Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Kellough, William"'
We investigate a cheating robot version of Cops and Robber, first introduced by Huggan and Nowakowski, where both the cops and the robber move simultaneously, but the robber is allowed to react to the cops' moves. For conciseness, we refer to this ga
Externí odkaz:
http://arxiv.org/abs/2409.11581
We introduce the bodyguard problem for graphs. This is a variation of Surrounding Cops and Robber but, in this model, a smallest possible group of bodyguards must surround the president and then maintain this protection indefinitely. We investigate s
Externí odkaz:
http://arxiv.org/abs/2408.10452
Graph burning is a discrete-time process that models the spread of influence in a network. Vertices are either burning or unburned, and in each round, a burning vertex causes all of its neighbours to become burning before a new fire source is chosen
Externí odkaz:
http://arxiv.org/abs/2211.15633
Publikováno v:
In Discrete Mathematics January 2025 348(1)
Autor:
Kellough, William
Publikováno v:
Chronicles of Oklahoma; Spring2011, Vol. 89 Issue 1, p52-71, 20p