Buchtel College of Arts and Sciences

Date of Last Revision

2023-05-04 07:38:34


Applied Mathematics

Honors Course


Number of Credits


Degree Name

Bachelor of Science

Date of Expected Graduation

Spring 2021


Nested networks have several applications in phylogenetics and electrical circuit theory. In many cases, there may exist more than one distinct network which correctly models a given data set. This proposes a combinatorial problem to determine all possible network solutions. In this paper, we partially solve this problem by developing exponential generating functions which enumerate all 1-nested and 2-nested unicyclic networks. We also describe our procedure to directly count all 1-nested and 2-nested networks and provide all 1-nested networks with 7, 8, and 9 terminal nodes.

Research Sponsor

Stefan Forcey

First Reader

James P. Cossey

Second Reader

Hung Nguyen

Honors Faculty Advisor

Curtis B. 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.