The burning number of a graph is a graph parameter that models the spread of a contagion in a system. It is based on graph searching problems such as the firefighter problem and graph domination. The smaller the burning number of a graph, the faster the contagion spreads. In this paper we develop a program to calculate the burning number of a tree. We use this to investigate the correlation between tree properties and the burning number of a tree. We conclude with an alternative program design, and discuss open problems related to the burning number of trees and connected graphs.
Price Jones, Rhys
Computer Science; Mathematics
Sokolich, Michael, "An Investigation of the Burning Number of Graphs and Trees" (2016). Senior Independent Study Theses. Paper 7070.
Graph Theory, Burning Number
Bachelor of Arts
Senior Independent Study Thesis
© Copyright 2016 Michael Sokolich