On the reconstruction of the matching polynomial and the reconstruction conjecture (Q1820796): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123241990, #quickstatements; #temporary_batch_1705508227706 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:47, 1 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
