Abstract
Graph burning is a deterministic discrete time graph process that can be interpreted as a model for the spread of influence in social networks. The burning number b(G) of a graph G is the minimum number of steps in a graph burning process for that graph. In this paper, we introduced a new graph parameter, the generalized burning number of a graph br(G), which is generalization of b(G) with b1(G)=b(G). And then determined the generalized burning number of several graphs and operation graphs. The general bounds on this parameter are also discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
