| dc.rights.license | In Copyright | en_US |
| dc.creator | Bethea, Candace A. | |
| dc.date.accessioned | 2015-07-29T19:59:08Z | |
| dc.date.available | 2015-07-29T19:59:08Z | |
| dc.date.created | 2015 | |
| dc.identifier | WLURG38_Bethea_MATH_2015 | |
| dc.identifier.uri | http://hdl.handle.net/11021/32170 | |
| dc.description | Thesis; [FULL-TEXT RESTRICTED TO WASHINGTON AND LEE UNIVERSITY LOGIN] | en_US |
| dc.description | Candace A. Bethea is a member of the Class of 2015 of Washington and Lee University. | en_US |
| dc.description.abstract | Our work continues a long tradition in graph theory studying the relation-
ship between vertex connectivity, edge connectivity, and minimum degree. [From Introduction] | en_US |
| dc.description.statementofresponsibility | Candace Bethea | |
| dc.format.extent | 32 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 | Bethea, Candace A. | |
| dc.subject.fast | Graph connectivity | en_US |
| dc.subject.fast | Graph theory | en_US |
| dc.subject.fast | Harary, Frank | en_US |
| local.department | Mathematics | en_US |
| local.scholarshiptype | Honors Thesis | en_US |
