Steinhaus Graphs and Pendent Vertices
![Thumbnail](/bitstream/handle/11021/36376/WLURG038_Davis_thesis_2010.pdf.jpg?sequence=4&isAllowed=y)
View/ Open
Author
Davis, Josiah William
Subject
Washington and Lee University -- Honors in Mathematics
Steinhaus, Hugo, 1887-1972
Graph theory
Metadata
Show full item recordDescription
Steinhaus graphs have many interesting properties, yet there are many things about them that are not yet known. In [1 ], a formula was discovered for the total number of Steinhaus graphs on n vertices with at least one pendent vertex. Our research goal was to try to further characterize this result. Can we describe the the number of Steinhaus graphs on n vertices with exactly k pendent vertices? Let P(n, k) be the number of Steinhaus graphs on n vertices with k pendent vertices. Our task was to find an explicit formula for it. [From Introduction]