Selected Applications of the Nash-Williams Lemma

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.

Name thesis:degree_name

Master of Science in Mathematics

Level thesis:degree_level

Masters

Discipline thesis:degree_discipline

Mathematics

Year

1998

Author dc:creator

• Brom, Matthew Arthur

Contributors dc:contributor

• Cameron Wickham

• Mathematics

Statement dc:rights

• © Matthew Arthur Brom

Repository record dc:identifier

https://bearworks.missouristate.edu/theses/861

OAI identifier oai:identifier

oai:bearworks.missouristate.edu:theses-1862