Some results on the spectral reconstruction problem

This paper is concerned with the spectral version of the reconstruction conjecture: Whether a graph with n>2 vertices is determined (up to isomorphism) by the collection of its spectrum and the spectrum of its vertex-deleted graphs? Some positive results as well as a method for constructing counterexamples to the problem are provided.