The ally‐reconstruction number of a tree with five or more vertices is three
Wendy J. Myrvold · Journal of Graph Theory · 1990
Abstract The ally‐reconstruction number of a graph G , ally‐rn( G ), is the minimum number of vertex‐deleted subgraphs required in order to identify G up to isomorphism. In this paper, we show that ally‐rn( T ) = 3 for any tree T with five or more vertices.