Related papers: Burning games on strong path products
Suppose we have a network that is represented by a graph $G$. Potentially a fire (or other type of contagion) might erupt at some vertex of $G$. We are able to respond to this outbreak by establishing a firebreak at $k$ other vertices of…
Motivated by the success of domination games and by a variation of the coloring game called the indicated coloring game, we introduce a version of domination games called the indicated domination game. It is played on an arbitrary graph $G$…
We investigate a game played between two players, Maker and Breaker, on a countably infinite complete graph where the vertices are the rational numbers. The players alternately claim unclaimed edges. It is Maker's goal to have after…
Lazy burning is a recently introduced variation of burning where only one set of vertices is chosen to burn in the first round. In hypergraphs, lazy burning spreads when all but one vertex in a hyperedge is burned. The lazy burning number…
The applications of graph coloring are diverse and many so lots of new types of coloring are being proposed and explored. Here we define a safe k-coloring, motivated by the application of coloring to secret sharing. Secret sharing is a way…
In this work, we study the problem of clearing contamination spreading through a large network where we model the problem as a graph searching game. The problem can be summarized as constructing a search strategy that will leave the 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…
A $k$-dispersed labelling of a graph $G$ on $n$ vertices is a labelling of the vertices of $G$ by the integers $1, \dots , n$ such that $d(i,i+1) \geq k$ for $1 \leq i \leq n-1$. $DL(G)$ denotes the maximum value of $k$ such that $G$ has a…
Generation of graphs is a major challenge for real-world tasks that require understanding the complex nature of their non-Euclidean structures. Although diffusion models have achieved notable success in graph generation recently, they are…
The deduction game is a variation of the game of cops and robber on graphs in which searchers must capture an invisible evader in at most one move. Searchers know each others' initial locations, but can only communicate if they are on the…
Security games model the confrontation between a defender protecting a set of targets and an attacker who tries to capture them. A variant of these games assumes security interdependence between targets, facilitating contagion of an attack.…
Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a piece, and hands them to an adversary who distributes them among the vertices of G (called a configuration) and chooses a target vertex r. The…
We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling game, one player distributes a set amount of weight on the edges of a graph and his opponent chooses a target vertex and places a configuration of…
A pebbling move refers to the act of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The goal of graph pebbling is: Given an initial distribution of pebbles, use pebbling moves to reach a specified goal…
In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph $\mathcal{H}$ by two players, namely Dominator and Staller, who alternately select vertices such that each selected vertex enlarges the…
We study common randomness generation problems where $n$ players aim to generate same sequences of random coin flips where some subsets of the players share an independent common coin which can be tossed multiple times, and there is a…
To address the dynamic nature of real-world networks, we generalize competitive diffusion games and Voronoi games from static to temporal graphs, where edges may appear or disappear over time. This establishes a new direction of studies in…
Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been successfully…
We study feature propagation on graph, an inference process involved in graph representation learning tasks. It's to spread the features over the whole graph to the $t$-th orders, thus to expand the end's features. The process has been…
Graph coloring is fundamental to distributed computing. We give the first general treatment of the coloring of virtual graphs, where the graph $H$ to be colored is locally embedded within the communication graph $G$. Besides generalizing…