The graph reconstruction number

@article{Harary1985TheGR,
  title={The graph reconstruction number},
  author={Frank Harary and Michael Plantholt},
  journal={Journal of Graph Theory},
  year={1985},
  volume={9},
  pages={451-454}
}
The reconstruction number of graph G is the minimum number of pointdeleted 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 conjecture that almost all graphs have reconstruction number three. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
19 Extracted Citations
1 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.

On the reconstruction of a graph from a collection of subgraphs

  • E Harary
  • Theory of Graphs and Its Applications. Academic,
  • 1964

Similar Papers

Loading similar papers…