Adversarial graph burning densities

Karen Gunderson, William Kellough, JD Nir +1

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 o…