期刊名称:International Journal of Mathematics and Mathematical Sciences
印刷版ISSN:0161-1712
电子版ISSN:1687-0425
出版年度:1987
卷号:10
DOI:10.1155/S016117128700019X
出版社:Hindawi Publishing Corporation
摘要: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.