Date of Award
The goal of this thesis is to study two related problems that, in the broadest terms, lie in a branch of mathematics called graph theory. The first problem examines some new techniques for constructing a Hamilton graph of least possible order and having a preassigned girth, and the second concerns the enumeration of a certain type of graphs called trees.
Gilliland, Erica R., "Constructions and Enumeration Methods for Cubic Graphs and Trees" (2013). Undergraduate Honors Thesis Collection. 360.