| dc.rights.license | In Copyright | en_US |
| dc.creator | Sears, Lewis N., IV (Lew) | |
| dc.date.accessioned | 2016-07-27T14:51:22Z | |
| dc.date.available | 2016-07-27T14:51:22Z | |
| dc.date.created | 2016 | |
| dc.identifier | WLURG38_Sears_MATH_2016 | |
| dc.identifier.uri | http://hdl.handle.net/11021/33566 | |
| dc.description | Thesis; [FULL-TEXT FREELY AVAILABLE ONLINE] | en_US |
| dc.description | Lewis N. Sears is a member of the Class of 2016 of Washington and Lee University. | en_US |
| dc.description.abstract | This 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.statementofresponsibility | Lewis Sears IV | |
| dc.format.extent | 25 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 | Realizability 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 | Sears, Lewis N., IV (Lew) | |
| 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 |
