A note on the vertex-switching reconstruction
The author investigates the vertex-switching reconstruction problem, which was proposed by \textit{R. P. Stanley} [J. Comb. Theory, Ser. B 38, 132-138 (1985; Zbl 0572.05046)]. It is shown that any disconnected graph with at least five vertices is reconstructible. In addition, reconstructibility is established for graphs having a vertex of degree ``not close to n/2''.
scientific article; zbMATH DE number 4083671