dc.rights.license | In Copyright | en_US |
dc.creator | Hardnett, Alyssa P. | |
dc.date.accessioned | 2014-06-18T18:54:08Z | |
dc.date.available | 2016-06-19T08:59:48Z | |
dc.date.created | 2014 | |
dc.identifier | WLURG38_Hardnett_MATH_2014 | |
dc.identifier.uri | http://hdl.handle.net/11021/28510 | |
dc.description | Thesis; [FULL-TEXT RESTRICTED TO WASHINGTON AND LEE UNIVERSITY LOGIN] | en_US |
dc.description | Alyssa Hardnett is a member of the Class of 2014 of Washington and Lee University. | en_US |
dc.description.statementofresponsibility | Alyssa Hardnett | |
dc.format.extent | 15 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 | Realizablity of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree (thesis) | en_US |
dc.type | Text | en_US |
dcterms.isPartOf | RG38 - Student Papers | |
dc.rights.holder | Hardnett, Alyssa P. | |
dc.subject.fast | Graph theory | en_US |
dc.subject.fast | Graph connectivity | en_US |
local.department | Mathematics | en_US |
local.scholarshiptype | Honors Thesis | en_US |