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.
Open Access
A note on the vertex-switching reconstruction
Received07 Oct 1987
Revised15 Nov 1987
Copyright
Copyright © 1988 Hindawi Publishing Corporation. This is an open access article distributed under the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.