Reconstruction conjecture

Informally, the reconstruction conjecture in graph theory says that graphs are determined uniquely by their subgraphs. It is due to Kelly and Ulam. Informally, the reconstruction conjecture in graph theory says that graphs are determined uniquely by their subgraphs. It is due to Kelly and Ulam. Given a graph G = ( V , E ) {displaystyle G=(V,E)} , a vertex-deleted subgraph of G {displaystyle G} is a subgraph formed by deleting exactly one vertex from G {displaystyle G} . By definition, it is an induced subgraph of G {displaystyle G} . For a graph G {displaystyle G} , the deck of G, denoted D ( G ) {displaystyle D(G)} , is the multiset of isomorphism classes of all vertex-deleted subgraphs of G {displaystyle G} . Each graph in D ( G ) {displaystyle D(G)} is called a card. Two graphs that have the same deck are said to be hypomorphic.