Abstract
The intent of this thesis is to explore whether any patterns emerge among families or through graph operations regarding the appearance of Weierstrass vertices on graphs. Currently, patterns have been identified and proven on cycles, complete graphs, complete bipartite graphs, and the house and house-x graphs. A Python program developed as part of this thesis to perform the algorithms used in this analysis confirms these findings. This program also revealed a pattern: if v is a Weierstrass vertex, then the vertex v* added to the graph as a pendant vertex to v is also a Weierstrass vertex. The converse is also true: if v is not a Weierstrass vertex, v* will not be either.
Thesis Completion
2023
Semester
Fall
Thesis Chair/Advisor
Brennan, Joseph
Degree
Bachelor of Science (B.S.)
College
College of Sciences
Department
Mathematics
Degree Program
Mathematics
Language
English
Access Status
Open Access
Release Date
12-15-2023
Recommended Citation
Gill, Abrianna L., "Weierstrass Vertices on Finite Graphs" (2023). Honors Undergraduate Theses. 1529.
https://stars.library.ucf.edu/honorstheses/1529