Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Mathematics
Tangled Up In Tanglegrams, Drew Joseph Scalzo
Tangled Up In Tanglegrams, Drew Joseph Scalzo
Theses and Dissertations
Tanglegrams are graphs consisting of two rooted binary plane trees with the same number of leaves and a perfect matching between the two leaf sets. A Tanglegram drawing is a special way of drawing a Tanglegram; and a Tanglegram is called planar if it has a drawing such that the matching edges do not cross. In this thesis, we will discuss various results related to the construction and planarity of Tanglegrams, as well as demonstrate how to construct all the Tanglegrams of size 4 by looking at two types of rooted binary trees - Caterpillar and Complete Binary Trees. After …
Results On Select Combinatorial Problems With An Extremal Nature, Stephen Smith
Results On Select Combinatorial Problems With An Extremal Nature, Stephen Smith
Theses and Dissertations
This dissertation is split into three sections, each containing new results on a particular combinatorial problem. In the first section, we consider the set of 3-connected quadrangulations on n vertices and the set of 5-connected triangulations on n vertices. In each case, we find the minimum Wiener index of any graph in the given class, and identify graphs that obtain this minimum value. Moreover, we prove that these graphs are unique up to isomorphism.
In the second section, we work with structures emerging from the biological sciences called tanglegrams. In particular, our work pertains to an invariant of tanglegrams called …