Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Kellough, William"'
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
Autor:
Kellough, William
Publikováno v:
Chronicles of Oklahoma; Spring2011, Vol. 89 Issue 1, p52-71, 20p