| dc.rights.license | In Copyright | en_US |
| dc.creator | Davis, Josiah William | |
| dc.date.accessioned | 2023-10-20T17:40:31Z | |
| dc.date.available | 2023-10-20T17:40:31Z | |
| dc.date.created | 2010 | |
| dc.identifier | WLURG038_Davis_thesis_2010 | |
| dc.identifier.uri | https://dspace.wlu.edu/handle/11021/36376 | |
| dc.description.abstract | 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] | en_US |
| dc.format.extent | 9 pages | en_US |
| dc.language.iso | en_US | en_US |
| dc.rights | This material is made available for use in research, teaching, and private study, pursuant to U.S. Copyright law. The user assumes full responsibility for any use of the materials, including but not limited to, infringement of copyright and publication rights of reproduced materials. Any materials used should be fully credited with the source. | en_US |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en_US |
| dc.subject.other | Washington and Lee University -- Honors in Mathematics | en_US |
| dc.title | Steinhaus Graphs and Pendent Vertices | en_US |
| dc.type | Text | en_US |
| dcterms.isPartOf | WLURG038 - Student Papers | en_US |
| dc.rights.holder | Davis, Josiah William | en_US |
| dc.subject.fast | Steinhaus, Hugo, 1887-1972 | en_US |
| dc.subject.fast | Graph theory | en_US |
| local.department | Mathematics | en_US |
