6 citations · 9 across the 16 of their papers we have counts for
18 papers
The Infectious Vaccination Problem: a variant of Firefighting with Spreading Defence
Jessica Enright, Melissa A. Huggan, Ethan Hunter-Frankland +2
The Firefighter Problem models a spreading process (originally a fire, alternatively an infection or rumour, for example) on a graph. A defender saves a single vertex per turn; aft…
Discrete-time treatment number of binary trees
Karen L. Collins, Margaret-Ellen Messinger, Ann N. Trenk
The discrete-time treatment number of a graph , denoted by , was introduced in arXiv:2408.0531(3) and arises from a deterministic process in which each vertex is assigned…
On Pancyclicity in a Mixed Model for Domination Reconfiguration
Margaret-Ellen Messinger, Logan Pipes
A new model for domination reconfiguration is introduced which combines the properties of the preexisting token addition/removal (TAR) and token sliding (TS) models. The vertices o…
Graph Burning On Large -Caterpillars
Danielle Cox, M. E. Messinger, Kerry Ojakian
Graph burning models the spread of information or contagion in a graph. At each time step, two events occur: neighbours of already burned vertices become burned, and a new vertex i…
The 2-burning number of a graph
C. B. Jacobs, M. E. Messinger, A. N. Trenk
We study a discrete-time model for the spread of information in a graph, motivated by the idea that people believe a story when they learn of it from two different origins. Similar…
Discrete-time treatment number
N. E. Clarke, K. L. Collins, M. E. Messinger +2
We introduce the discrete-time treatment number of a graph, in which each vertex is in exactly one of three states at any given time-step: compromised, vulnerable, or treated. Our…