International Journal of Mathematics and Mathematical Sciences
Volume 11 (1988), Issue 4, Pages 825-827
doi:10.1155/S0161171288001012
Abstract
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.