%0 Journal Article
%T On the reconstraction of the matching polynomial and the reconstruction conjecture
%A E. J. Farrell
%A S. A. Wahid
%J International Journal of Mathematics and Mathematical Sciences
%D 1987
%I Hindawi Publishing Corporation
%R 10.1155/s016117128700019x
%X Two results are proved. (i) It is shown that the matching polynomial is both node and edge reconstructable. Moreover a practical method of reconstruction is given. (ii) A technique is given for reconstructing a graph from its node-deleted and edge-deleted subgraphs. This settles one part of the Reconstruction Conjecture.
%K matching
%K perfect matching
%K matching polynomial
%K matching matrix
%K reconstruction conjecture
%K edge reconstruction
%K node reconstruction.
%U http://dx.doi.org/10.1155/S016117128700019X