Related papers: 3/2 Firefighters are not enough
We consider "Containment": a variation of the graph pursuit game of Cops and Robber in which cops move from edge to adjacent edge, the robber moves from vertex to adjacent vertex (but cannot move along an edge occupied by a cop), and the…
We consider a surrounding variant of cops and robbers on graphs of bounded genus. We obtain bounds on the number of cops required to surround a robber on planar graphs, toroidal graphs, and outerplanar graphs. We also obtain improved bounds…
Our main goal is to examine the role of communities in epidemic spread in a random graph model. More precisely, we consider a random graph model which consists of overlapping complete graphs, representing households, workplaces, school…
We consider a variation of the Cops and Robber game where the cops can only see the robber when the distance between them is at most a fixed parameter $\ell$. We consider the basic consequences of this definition for some simple graph…
The Burning Number Conjecture claims that for every connected graph $G$ of order $n,$ its burning number satisfies $b(G) \le \lceil \sqrt{n} \rceil.$ While the conjecture remains open, we prove that it is asymptotically true when the order…
The parallel chip-firing game is an automaton on graphs in which vertices "fire" chips to their neighbors when they have enough chips to do so. The game is always periodic, and we concern ourselves with the firing sequences of vertices. We…
The vast majority of strategies aimed at controlling contagion processes on networks considers the connectivity pattern of the system as either quenched or annealed. However, in the real world many networks are highly dynamical and evolve…
We consider the new game of Cops and Attacking Robbers, which is identical to the usual Cops and Robbers game except that if the robber moves to a vertex containing a single cop, then that cop is removed from the game. We study the minimum…
Premixed flames propagating within small channels show complex combustion phenomena that differ from flame propagation at conventional scales. Available experimental and numerical studies have documented stationary/non-stationary and/or…
In a graph, a watchman's walk is a minimum closed dominating walk. Given a graph $G$ and a single watchman, the length of a watchman's walk in $G$ (the watchman number) is denoted by $w(G)$ and the typical goals of the watchman's walk…
Given a network of nodes, minimizing the spread of a contagion using a limited budget is a well-studied problem with applications in network security, viral marketing, social networks, and public health. In real graphs, virus may infect a…
Motivated by dynamic graph visualization, we study the problem of representing a graph $G$ in the form of a \emph{storyplan}, that is, a sequence of frames with the following properties. Each frame is a planar drawing of the subgraph of $G$…
The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalises naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for…
A two-dimensional model of wildfire spread and merger is presented. Three features affect the fire propagation: (i) a constant basic rate of spread term accounting for radiative and convective heat transfer, (ii) the unidirectional,…
We study the parameterized complexity of interdiction problems in graphs. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of two players, namely, an interdictor and an evader, who…
We study a game on a graph $G$ played by $r$ {\it revolutionaries} and $s$ {\it spies}. Initially, revolutionaries and then spies occupy vertices. In each subsequent round, each revolutionary may move to a neighboring vertex or not move,…
We consider the problem of reducing the (semi)total domination number of graph by one by contracting edges. It is known that this can always be done with at most three edge contractions and that deciding whether one edge contraction…
A cyber security problem in a networked system formulated as a resilient graph problem based on a game-theoretic approach is considered. The connectivity of the underlying graph of the network system is reduced by an attacker who removes…
It is proposed that using both self-non-self and danger theories give a better understanding of how the immune system works. It is proposed that comparing immune system to police force is useful in this case since police responds both to…
Viruses constantly undergo mutations with genomic changes. The propagation of variants of viruses is an interesting problem. We perform numerical simulations of the microscopic epidemic model based on network theory for the spread of…