Ulam in [7] has conjectured that any graph G with p≥3 nodes is uniquely reconstructable from its collection of subgraphs Gi=G-vi, i=1,2, … p. This conjecture has been proved for various finite graphs including regular, Eulerian, unicyclic, separable, trees and cacti. Since Ulam′s conjecture seems difficult to prove or disprove, some authors have tried to strengthen the conjecture [3]. One of these stronger conjectures is Harary′s conjecture [2].