Buchtel College of Arts and Sciences (BCAS)

Date of Last Revision

2023-05-03 16:08:32


Applied Mathematics

Honors Course


Number of Credits


Degree Name

Bachelor of Science

Date of Expected Graduation

Spring 2020


Phylogenetic Networks are defined to be simple connected graphs with exactly n labeled nodes of degree one, called leaves, and where all other unlabeled nodes have a degree of at least three. These structures assist us with analyzing ancestral history, and its close relative - phylogenetic trees - garner the same visualization, but without the graph being forced to be connected. In this paper, we examine the various characteristics of Phylogenetic Networks and functions that take these networks as inputs, and convert them to more complex or simpler structures. Furthermore, we look at the nature of functions as they relate to the program NeighborNet, which inputs networks numerically and describes how they interact against multiple types of networks. Finally, by building upon previous research in this field, we attempt to comprise a formula for counting the total number of possible unweighted binary, triangle free, 2-nested networks.

Research Sponsor

Dr. Stefan Forcey

First Reader

Dr. James Cossey

Second Reader

Dr. Kevin Kreider

Honors Faculty Advisor

Dr. Curtis Clemons



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.