Abstract Information spread is an intriguing topic to study in network science, which
investigates how information, influence, or contagion propagate through networks. Graph …

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 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 …

Social networks are used extensively for advertising, political campaigning, and spreading
awareness. Usually, there is an underlying diffusion model using which the information …

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 …

Given a graph $ G $, the optimization version of the graph burning problem seeks for a
sequence of vertices, $(u_1, u_2,..., u_p)\in V (G)^ p $, with minimum $ p $ and such that …

Graph burning runs on discrete time steps. The aim is to burn all the vertices in a given
graph in the least number of time steps. This number is known to be the burning number of …

Graph burning runs on discrete time-steps. The aim is to burn all the vertices in a given
graph using a minimum number of time-steps. This number is known to be the burning …

The concept of graph burning and burning number ($ bn (G) $) of a graph G was introduced
recently [1]. Graph burning models the spread of contagion (fire) in a graph in discrete time …