A note on the vertex‐switching reconstruction
Ilia Krasikov · International Journal of Mathematics and Mathematical Sciences · 1987
Bounds on the maximum and minimum degree of a graph establishing its reconstructibility from the vertex switching are given. It is also shown that any disconnected graph with at least five vertices is reconstructible.