On the reconstruction of the matching polynomial and the reconstruction conjecture (Q1820796): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q689954 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Thomas Andreae / rank | |||
Normal rank | |||
Revision as of 07:56, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the reconstruction of the matching polynomial and the reconstruction conjecture |
scientific article |
Statements
On the reconstruction of the matching polynomial and the reconstruction conjecture (English)
0 references
1987
0 references
It is shown that the matching polynomial is both node and edge reconstructible. Moreover, given a deck of vertex-deleted (or edge- deleted) graphs of an unknown graph G, a practical method is given which determines G and (if G is not reconstructible) all other graphs with the same deck.
0 references
node reconstructibility
0 references
edge reconstructibility
0 references
matching polynomial
0 references
