Show simple item record

dc.rights.licenseIn Copyrighten_US
dc.creatorDavis, Josiah William
dc.date.accessioned2010-07-26T19:19:49Z
dc.date.created2010
dc.identifierWLURG38_Davis_MATH_2010
dc.identifier.urihttp://hdl.handle.net/11021/16353
dc.descriptionThesis; [FULL-TEXT RESTRICTED TO WASHINGTON AND LEE UNIVERSITY LOGIN]en_US
dc.descriptionJosiah William Davis is a member of the Class of 2010 of Washington and Lee University.en_US
dc.description.abstractSteinhaus 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 11 vertices with at least one pendent vertex. Our research goal was to try to further characterize this result. Can we describe 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. [introduction]en_US
dc.description.statementofresponsibilityJosiah Davis
dc.format.extent9 pagesen_US
dc.language.isoen_USen_US
dc.rightsThis 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.urihttp://rightsstatements.org/vocab/InC/1.0/en_US
dc.subject.otherWashington and Lee University -- Honors in Mathematicsen_US
dc.titleSteinhaus Graphs and Pendent Vertices (thesis)en_US
dc.typeTexten_US
dcterms.isPartOfRG38 - Student Papers
dc.rights.holderDavis, Josiah William
dc.subject.fastSteinhaus, Hugo, 1887-1972en_US
dc.subject.fastGraph theoryen_US
local.departmentMathematicsen_US
local.scholarshiptypeHonors Thesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record