The generalized burning number of graphs

Yinkui Li, Xiaoxiao Qin and Wen Li

Applied Mathematics and Computation, 2021, vol. 411, issue C

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.

Keywords: The burning number; The generalized burning number; Crown graphs; Helm graphs (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321003957
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:411:y:2021:i:c:s0096300321003957

DOI: 10.1016/j.amc.2021.126306

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().