Yinkui Li

1. Introduction Graph burning is a discrete-time process on graphs [1], Bonato et al. introduced the concept of the burning number to measures the speed of contagion spread on a graph and denoted the burning number of graph G by b( G ) in [2], some special classes of graphs has been studied, such as spider graphs [3], path forest [4], generalized Petersen graphs [5], theta graphs [6], caterpillars [7] and fence graphs [8]. For a survey on graph burning see [9]. Later, Li et al.

1. Introduction Graph burning is a discrete-time process on graphs, which is a model for describing the spread of influence in social networks. In [1], Bonato et al. introduced the burning number of graph G to measure the speed of contagion spread on G . Research on graph burning see [2]. In [3], authors generalized the concept of burning number b( G ) of graph G and proposed the generalized burning b r ( G ) with b 1 ( G )=b( G ) .

1. Introduction It is a common method to study network problems using graphs to represent network structures and utilizing the concepts of nodes and edges in graph theory to represent relationships between objects in the networks. However, the application of graphs to describe complex network structures may result in incomplete or inaccurate information.