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

Download

Included in

Mathematics Commons

Share

COinS
 

Accessibility Statement

This item was created or digitized prior to April 24, 2027, or is a reproduction of legacy media created before that date. It is preserved in its original, unmodified state specifically for research, reference, or historical recordkeeping. In accordance with the ADA Title II Final Rule, the University Libraries provides accessible versions of archival materials upon request. To request an accommodation for this item, please submit an accessibility request form.