The reconstruction number rn(G) of graph G is the minimum number of vertex-deleted subgraphs of G required in order to identify G up to isomporphism. Myrvold and Molina have shown that if G isâ€¦ (More)

Frank Harary contributed numerous questions to a variety of topics in graph theory. One of his favourite topics was the Reconstruction Problem which, in its first issue in 1977, the Journal of Graphâ€¦ (More)

The edge-reconstruction number ern(G) of a graph G is equal to the minimum number of edge-deleted subgraphs Gâˆ’e of G which are sufficient to determine G up to isomorphism. Building upon the work ofâ€¦ (More)

An edge-card of a graph G is a subgraph formed by deleting an edge. The edge-reconstruction number of a graph G, ern(G), is the minimum number of edge-cards required to determine G up to isomorphism.â€¦ (More)

The (vertex) path-table of a tree T contains quantitative information about the paths in T . The entry (i, j) of this table gives the number of paths of length j passing through vertex vi. Theâ€¦ (More)