The graph reconstruction number
Frank Harary, Michael J. Plantholt · Journal of Graph Theory · 1985
Abstract The reconstruction number of graph G is the minimum number of point‐deleted subgraphs required in order to uniquely identify the original graph G. We list, based on computer calculations, the reconstruction number for all graphs with at most seven points. Some constructions and conjectures for graphs of higher order are given. the most striking statement is our concluding conjeture that almost all graphs have have reconstruction number three.