Graphs measure interactions between objects such as friendship links on Twitter,
transactions between Bitcoin users, and the flow of energy in a food chain. While graphs …

Graph burning is a deterministic, discrete-time process that models how influence or
contagion spreads in a graph. Associated to each graph is its burning number, which is a …

Numerous approaches study the vulnerability of networks against social contagion. Graph
burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The …

Graph burning is a deterministic discrete time graph process that can be interpreted as a
model for the spread of influence in social networks. The burning number b (G) of a graph G …

Featured Application This study provides heuristics for potential usage in minimizing time
steps for fast spreading an alarm or other critical information, for example via satellite …

Graph burning is a model for the spread of social influence in networks. The objective is to
measure how quickly a fire (eg, a piece of fake news) can be spread in a network. The …

The burning number b (G) of a graph G was introduced by Bonato, Janssen, and Roshanbin
[Lecture Notes in Computer Science 8882 (2014)] to measure the speed of the spread of …

The graph burning problem is an NP-hard combinatorial optimization problem that helps
quantify how vulnerable a graph is to contagion. This paper introduces three mathematical …

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 that have to be given …

Graph burning is a process to determine the spreading of information in a graph. If a
sequence of vertices burns all the vertices of a graph by following the graph burning …