Premium
The graph reconstruction number
Author(s) -
Harary Frank,
Plantholt Michael
Publication year - 1985
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190090403
Subject(s) - combinatorics , mathematics , graph , discrete mathematics
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.