On the reconstruction of the matching polynomial and the reconstruction conjecture (Q1820796)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3995728
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the reconstruction of the matching polynomial and the reconstruction conjecture |
scientific article; zbMATH DE number 3995728 |
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
0.91277146
0 references
0.9017986
0 references
0.8912386
0 references
0.89024276
0 references
0.88988656
0 references
0.88943565
0 references
