Burning Geometric Graphs

by   Arya Tanmay Gupta, et al.

A procedure called graph burning was introduced to facilitate the modelling of spread of an alarm, a social contagion, or a social influence or emotion on graphs and networks. Graph burning runs on discrete time-steps (or rounds). At each step t, first (a) an unburned vertex is burned (as a fire source) from "outside", and then (b) the fire spreads to vertices adjacent to the vertices which are burned till step t-1. This process stops after all the vertices of G have been burned. The aim is to burn all the vertices in a given graph in minimum time-steps. The least number of time-steps required to burn a graph is called its burning number. The less the burning number is, the faster a graph can be burned. Burning a general graph optimally is an NP-Complete problem. It has been proved that optimal burning of path forests, spider graphs, and trees with maximum degree three is NP-Complete. We study the graph burning problem on several sub-classes of geometric graphs. We show that burning interval graphs (Section 7.1, Theorem 7.1), permutation graphs (Section 7.2, Theorem 7.2) and disk graphs (Section 7.3, Theorem 7.3) optimally is NP-Complete. In addition, we opine that optimal burning of general graphs (Section 9.2, Conjecture 9.1) cannot be approximated better than 3-approximation factor.


page 1

page 31


NP-completeness Results for Graph Burning on Geometric Graphs

Graph burning runs on discrete time steps. The aim of the graph burning ...

On the Burning Number of p-Caterpillars

The burning number is a recently introduced graph parameter indicating t...

On the End-Vertex Problem of Graph Searches

End vertices of graph searches can exhibit strong structural properties ...

Making Life More Confusing for Firefighters

It is well known that fighting a fire is a hard task. The Firefighter pr...

Hierarchical Clusterings of Unweighted Graphs

We study the complexity of finding an optimal hierarchical clustering of...

Burning Number for the Points in the Plane

The burning process on a graph G starts with a single burnt vertex, and ...

Proving the NP-completeness of optimal moral graph triangulation

Moral graphs were introduced in the 1980s as an intermediate step when t...

Please sign up or login with your details

Forgot password? Click here to reset