Burning number of theta graphs

Huiqing Liu, Ruiting Zhang and Xiaolan Hu

Applied Mathematics and Computation, 2019, vol. 361, issue C, 246-257

Abstract: The burning number b(G) of a graph G was introduced by Bonato, Janssen, and Roshanbin [Lecture Notes in Computer Science 8882(2014)] to measure the speed of the spread of contagion in a graph. The graph burning problem is NP-complete even for trees. In this paper, we show that the burning number of any theta graph of order n=q2+r with 1≤r≤2q+1 is either q or q+1. Furthermore, we characterize all theta graphs that have burning number q or q+1.

Keywords: Burning number; Theta graph; Distance domination; Rooted tree partition (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319304242
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:361:y:2019:i:c:p:246-257

DOI: 10.1016/j.amc.2019.05.031

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 ().