Abstract

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.

Advisor

Moynihan, Matthew

Second Advisor

Price Jones, Rhys

Department

Computer Science; Mathematics

Disciplines

Other Mathematics

Publication Date

2016

Degree Granted

Bachelor of Arts

Document Type

Senior Independent Study Thesis

Share

COinS
 

© Copyright 2016 Michael Sokolich