Show simple item record

dc.rights.licenseIn Copyrighten_US
dc.creatorSears, Lewis N., IV (Lew)
dc.date.accessioned2016-07-27T14:51:22Z
dc.date.available2016-07-27T14:51:22Z
dc.date.created2016
dc.date.issued2016
dc.identifier.urihttp://hdl.handle.net/11021/33566
dc.descriptionThesis; [FULL-TEXT FREELY AVAILABLE ONLINE]en_US
dc.descriptionLewis N. Sears is a member of the Class of 2016 of Washington and Lee University.en_US
dc.description.abstractThis is the fourth and nal thesis that concludes ProfessorWayne M. Dymacek's research project Realizability of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree. With the completion of this project, working through hundreds of cases, Professor Dymacek's students have successfully completed an exhaustive system to determine the realizability of any given parameters and produce these simple and undirected graphs for any possible order that is desired. [From Conclusion]en_US
dc.description.statementofresponsibilityLewis Sears IV
dc.format.extent25 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.titleRealizability of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree (thesis)en_US
dc.typeTexten_US
dc.rights.holderSears, Lewis N., IV (Lew)
dc.subject.fastGraph theoryen_US
dc.subject.fastGraph connectivityen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record