On the reconstraction of the matching polynomial and the reconstruction conjecture
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 Reco...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1987-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S016117128700019X |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832560346091487232 |
|---|---|
| author | E. J. Farrell S. A. Wahid |
| author_facet | E. J. Farrell S. A. Wahid |
| author_sort | E. J. Farrell |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-c51d5c014d6e41eaa00960616e5528ed |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1987-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-c51d5c014d6e41eaa00960616e5528ed2025-02-03T01:27:47ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251987-01-0110115516210.1155/S016117128700019XOn the reconstraction of the matching polynomial and the reconstruction conjectureE. J. Farrell0S. A. Wahid1Department of Mathematics, The University of the West Indies, St. Augustine, Trinidad and TobagoDepartment of Mathematics, The University of the West Indies, St. Augustine, Trinidad and TobagoTwo 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.http://dx.doi.org/10.1155/S016117128700019Xmatchingperfect matchingmatching polynomialmatching matrixreconstruction conjectureedge reconstructionnode reconstruction. |
| spellingShingle | E. J. Farrell S. A. Wahid On the reconstraction of the matching polynomial and the reconstruction conjecture International Journal of Mathematics and Mathematical Sciences matching perfect matching matching polynomial matching matrix reconstruction conjecture edge reconstruction node reconstruction. |
| title | On the reconstraction of the matching polynomial and the reconstruction conjecture |
| title_full | On the reconstraction of the matching polynomial and the reconstruction conjecture |
| title_fullStr | On the reconstraction of the matching polynomial and the reconstruction conjecture |
| title_full_unstemmed | On the reconstraction of the matching polynomial and the reconstruction conjecture |
| title_short | On the reconstraction of the matching polynomial and the reconstruction conjecture |
| title_sort | on the reconstraction of the matching polynomial and the reconstruction conjecture |
| topic | matching perfect matching matching polynomial matching matrix reconstruction conjecture edge reconstruction node reconstruction. |
| url | http://dx.doi.org/10.1155/S016117128700019X |
| work_keys_str_mv | AT ejfarrell onthereconstractionofthematchingpolynomialandthereconstructionconjecture AT sawahid onthereconstractionofthematchingpolynomialandthereconstructionconjecture |