From the 1 of 2 linked papers with an AI index.
2 papers
math.CO2026
Graph Burning: Bounds and Hardness
Dhanyamol Antony, L. Sunil Chandran, Anita Das +3
The paper studies the graph burning process, proving NP‑completeness for proper interval graphs, giving tight upper bounds for connected P_k‑free graphs, and analyzing edge and tot…
cs.DS2026
Hardness of Burning Number Problem on Regular Graphs
Dhanyamol Antony, L. Sunil Chandran, Anita Das +3
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…