FROM RECONSTRUCTION CONJECTURE TOWARDS
Subhashis Banerjee, Debajit Sensarma, Krishnendu Basuli, Samar Sen Sarma · 2012
The Reconstruction Conjecture has been synthesized under the characterized of matching Polynomial. A Polynomial time algorithm for generating matching polynomial of an undirected graph is given. Algorithms are given for reconstructing a graph from its node-deleted and edge-deleted subgraphs. Also the relation between the isomorphism and reconstruction has been investigated.