The Reconstruction Conjecture is one of the most important open problems in graph theory today. Proposed in 1942, the conjecture posits that every simple, finite, undirected graph with more than three vertices can be uniquely reconstructed up to isomorphism given the multiset of subgraphs produced by deleting each vertex of the original graph. Related to the Reconstruction Conjecture, reconstruction numbers concern the minimum number of vertex deleted subgraphs required to uniquely identify a graph up to isomorphism. During the summer of 2004, Jennifer Baldwin completed an MS project regarding reconstruction numbers. In it, she calculated reconstruction numbers for all graphs G where 2 < |V(G)| < 9. This project expands the computation of reconstruction numbers up to all graphs with ten vertices and a specific class of graphs with eleven vertices. Whereas Jennifer's project focused on a statistical analysis of reconstruction number results, we instead focus on theorizing the causes of high reconstruction numbers. Accordingly, this project establishes the reasons behind all high existential reconstruction numbers identified within the set of all graphs G where 2 < |V(G)| < 11 and identifies new classes of graphs that have large reconstruction numbers. Finally, we consider 2-reconstructibility - the ability to reconstruct a graph G from the multiset of subgraphs produced by deleting each combination of 2 vertices from G. The 2-reconstructibility of all graphs with nine or less vertices was tested, identifying two graphs in this range with five vertices as the highest order graphs that are 2-nonreconstructible.

Publication Date


Document Type

Master's Project

Student Type


Degree Name

Computer Science (MS)

Department, Program, or Center

Computer Science (GCCIS)


Stanislaw Radziszowski

Advisor/Committee Member

Chris Homan

Advisor/Committee Member

Darren Narayan


Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in July 2014.


RIT – Main Campus