{"id":{"repo_id":"mo-state","oai_identifier":"oai:bearworks.missouristate.edu:theses-1862"},"canonical_url":"https://search.dev.ndltd.org/etd/mo-state/oai:bearworks.missouristate.edu:theses-1862","repository":{"repo_id":"mo-state","name":"Missouri State University","base_url":"https://bearworks.missouristate.edu/do/oai/"},"display":{"title":"Selected Applications of the Nash-Williams Lemma","abstract":"The reader will be familiarized with the basic concepts of graph theory that are associated with the Edge Reconstruction Conjecture along with a formal statement and proof of the Nash-Williams Lemma. Reconstructibility conditions concerned with comparing the size and order of general graphs will then be established with an in depth look at conditions dealing with the minimum, average and maximum degrees of bidegreed, tridegreed, and fourdegreed graphs.","abstract_html":"The reader will be familiarized with the basic concepts of graph theory that are associated with the Edge Reconstruction Conjecture along with a formal statement and proof of the Nash-Williams Lemma. Reconstructibility conditions concerned with comparing the size and order of general graphs will then be established with an in depth look at conditions dealing with the minimum, average and maximum degrees of bidegreed, tridegreed, and fourdegreed graphs.","abstract_has_math":false,"creators":["Brom, Matthew Arthur"],"institution":null,"degree_name":"Master of Science in Mathematics","degree_level":"Masters","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Cameron Wickham"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1998,"date_issued":"1998-07-01T07:00:00Z","date_published":"1998-07-01T07:00:00Z","updated_at":"2026-07-24T03:15:54Z","subjects":["Mathematics"],"languages":[],"rights":["© Matthew Arthur Brom"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://bearworks.missouristate.edu/theses/861","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Cameron Wickham"]},{"key":"dc:creator","label":"Author","values":["Brom, Matthew Arthur"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["© Matthew Arthur Brom"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://bearworks.missouristate.edu/theses/861"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The reader will be familiarized with the basic concepts of graph theory that are associated with the Edge Reconstruction Conjecture along with a formal statement and proof of the Nash-Williams Lemma. Reconstructibility conditions concerned with comparing the size and order of general graphs will then be established with an in depth look at conditions dealing with the minimum, average and maximum degrees of bidegreed, tridegreed, and fourdegreed graphs."]},{"key":"dc:title","label":"Title","values":["Selected Applications of the Nash-Williams Lemma"]}]}],"canonical_facts":{"dc:contributor":["Cameron Wickham"],"dc:creator":["Brom, Matthew Arthur"],"dc:description.abstract":["The reader will be familiarized with the basic concepts of graph theory that are associated with the Edge Reconstruction Conjecture along with a formal statement and proof of the Nash-Williams Lemma. Reconstructibility conditions concerned with comparing the size and order of general graphs will then be established with an in depth look at conditions dealing with the minimum, average and maximum degrees of bidegreed, tridegreed, and fourdegreed graphs."],"dc:identifier":["https://bearworks.missouristate.edu/theses/861"],"dc:rights":["© Matthew Arthur Brom"],"dc:subject":["Mathematics"],"dc:title":["Selected Applications of the Nash-Williams Lemma"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Masters"],"thesis:degree_name":["Master of Science in Mathematics"]},"updated_at":"2026-07-24T03:15:54Z"}