Burning Circulant Graphs
Combinatorics
2018-06-08 v2
Abstract
In this paper we study the graph parameter of burning number, introduced by Bonato, Janssen, and Roshanbin (2014). We are particular interested in determining the burning number of Circulant graphs. In this paper, we find upper and lower bounds on the burning number of classes of circulant graphs of degree at most four. The burning number is found exactly for a family of circulant graphs of degree three, and two specific families of circulant graphs of degree four. Finally, we given upper and lower bounds on the burning number of families of circulant graphs of higher degree.
Cite
@article{arxiv.1706.03106,
title = {Burning Circulant Graphs},
author = {Shannon L. Fitzpatrick and Leif Wilm},
journal= {arXiv preprint arXiv:1706.03106},
year = {2018}
}
Comments
15 pages