Article citationsMore>>

Bessy, S., Bonato, A., Janssen, J., Rautenbach, D. and Roshanbin, E. (2017) Burning a Graph Is Hard. Discrete Applied Mathematics, 232, 73-87.
https://doi.org/10.1016/j.dam.2017.07.016

has been cited by the following article:

• TITLE: The Independent Cascade Graph Burning for Operation Graphs

  AUTHORS: Qiuye Zhu, Jiaqing Wu, Yinkui Li

  KEYWORDS: IC Burning Number, Binary Tree, Spider, Sunflower Graph

  JOURNAL NAME: Applied Mathematics, Vol.16 No.12, December 22, 2025

  ABSTRACT: Graph burning is a model to describe the spread of social influence. In 2023, Song et al. proposed the Independent Cascade Graph Burning model, where a vertex v can be burned by its burning neighbors u and the influence that u gives to v is larger than a given threshold β . The minimum number of time steps that can be chosen as rounds to burn the whole graph G with the Independent Cascade Graph Burning model called the IC burning number b β ( G ) . In this paper, we determined the IC burning number for some graphs and operation graphs.