Date of Award:
5-1985
Document Type:
Thesis
Degree Name:
Master of Science (MS)
Department:
Mathematics and Statistics
Department name when degree awarded
Mathematics
Committee Chair(s)
LeRoy Beasley
Committee
LeRoy Beasley
Committee
Dr. Ridenhour
Committee
Dr. Underwood
Abstract
In this paper we show that specific classes of graphs are reconstructible; we explore the relationship between the reconstruction and edge-reconstruction conjectures; we prove that several classes of graphs are actually Harary to the reconstructible; and we give counterexamples reconstruction and edge-reconstruction conjectures for infinite graphs.
Checksum
bdbdf2b4b466e77934e7664c6ef09758
Recommended Citation
Loveland, Susan M., "The Reconstruction Conjecture in Graph Theory" (1985). All Graduate Theses and Dissertations, Spring 1920 to Summer 2023. 7022.
https://digitalcommons.usu.edu/etd/7022
Included in
Copyright for this work is retained by the student. If you have any questions regarding the inclusion of this work in the Digital Commons, please email us at .