Correction of a Proof on the Ally-Reconstruction Number of a Disconnected Graph

The paper \([2]\) claimed that a disconnected graph with at least two nonisomorphic components is determined by some three of its vertex deleted subgraphs. While this statement is true, the proof in \([2]\) is incorrect. We give a correct proof of this fact.