On the edge-reconstruction number of a tree

Kevin Asciak, Josef Lauri, Wendy Myrvold +1

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 isomorphsim…