On the reconstraction of the matching polynomial and the reconstruction conjecture

E. J. Farrell and S. A. Wahid

International Journal of Mathematics and Mathematical Sciences, 1987, vol. 10, 1-8

Abstract:

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.

Date: 1987
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/10/281515.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/10/281515.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:281515

DOI: 10.1155/S016117128700019X

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().