Back to search

Hosted by Utah State University Libraries

The Reconstruction Conjecture in Graph Theory

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics and Statistics
Grantor dc:publisher
Hosted by Utah State University Libraries

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Loveland, Susan M.
Contributors dc:contributor
  • LeRoy Beasley
  • Dr. Ridenhour
  • Dr. Underwood

Subjects

dc:subject × 4

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Utah State University
Base URL
digitalcommons.usu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Loveland, Susan M.. The Reconstruction Conjecture in Graph Theory. Thesis thesis, Hosted by Utah State University Libraries, https://digitalcommons.usu.edu/etd/7022