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.
| Identifer | oai:union.ndltd.org:ucf.edu/oai:stars.library.ucf.edu:honorstheses-2713 |
| Date | 01 January 2023 |
| Creators | Gill, Abrianna L |
| Publisher | STARS |
| Source Sets | University of Central Florida |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Honors Undergraduate Theses |
Page generated in 0.0022 seconds