相关论文: Firefighting on square, hexagonal, and triangular …

Eternal vertex cover is the following two-player game between a defender and an attacker on a graph. Initially, the defender positions k guards on k vertices of the graph; the game then proceeds in turns between the defender and the…

Wildfires cause major losses worldwide, and the frequency of fire-weather conditions is likely to increase in many regions. We study the allocation of suppression resources over time on a graph-based representation of a landscape to slow…

We study a two-player game on a graph between an attacker and a defender. To begin with, the defender places guards on a subset of vertices. In each move, the attacker attacks an edge. The defender must move at least one guard across the…

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 is chosen to be burned. The big conjecture is known as the…

A flashover occurs when a fire spreads very rapidly through crevices due to intense heat. Flashovers present one of the most frightening and challenging fire phenomena to those who regularly encounter them: firefighters. Firefighters'…

The Burning Number Problem (BNP) models the spread of information or contagion in a network through a discrete-time process on a graph. At each step, one new vertex is selected as a burning source, while fire simultaneously spreads from…

We study a variant of the chip-firing game called \emph{diffusion}. In diffusion on a graph, each vertex of the graph is initially labelled with an integer interpreted as the number of chips at that vertex, and at each subsequent step, each…

Graph burning is a graph process that models the spread of social contagion. Initially, all the vertices of a graph $G$ are unburnt. At each step, an unburnt vertex is put on fire and the fire from burnt vertices of the previous step…

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…

Graph burning is a process of information spreading through the network by an agent in discrete steps. The problem is to find an optimal sequence of nodes which have to be given information so that the network is covered in least number of…

We consider random dynamics on a uniform random recursive tree with $n$ vertices. Successively, in a uniform random order, each edge is either set on fire with some probability $p_n$ or fireproof with probability $1-p_n$. Fires propagate in…

One of the most elementary spreading models on graphs can be described by a fire spreading from a burning vertex in discrete time steps. At each step, all neighbors of burning vertices catch fire. A well-studied extension to model fire…

The Probabilistic p-Center problem under Pressure (Min PpCP) is a variant of the usual p-Center problem we recently introduced in the context of wildfire management. The problem is to locate p shelters minimizing the maximum distance people…

The burning number is a recently introduced graph parameter indicating the spreading speed of content in a graph through its edges. While the conjectured upper bound on the necessary numbers of time steps until all vertices are reached is…

A graph $H$ is an \emph{isometric} subgraph of $G$ if $d_H(u,v)= d_G(u,v)$, for every pair~$u,v\in V(H)$. A graph is \emph{distance preserving} if it has an isometric subgraph of every possible order. A graph is \emph{sequentially distance…

We present fixed parameter tractable algorithms for the conflict-free coloring problem on graphs. Given a graph $G=(V,E)$, \emph{conflict-free coloring} of $G$ refers to coloring a subset of $V$ such that for every vertex $v$, there is a…

Given a non-decreasing function $f \colon \mathbb{N} \to \mathbb{N}$ we define a single player game on (infinite) connected graphs that we call fire retaining. If a graph $G$ admits a winning strategy for any initial configuration (initial…

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…

We prove that any Cayley graph $G$ with degree $d$ polynomial growth does not satisfy $\{f(n)\}$-containment for any $f=o(n^{d-2})$. This settles the asymptotic behaviour of the firefighter problem on such graphs as it was known that…

In this paper, the author considers the fractional mean field equation on a finite graph $G=(V,E)$, say \begin{equation*} (-\Delta)^s u=\rho\left(\dfrac{he^u}{\int_V he^ud\mu}-\dfrac{1}{|V|}\right),\quad\forall\,x\in V, \end{equation*}…