On the reconstruction of the matching polynomial and the reconstruction conjecture
type: Item
instance of: scholarly article
title: On the reconstruction of the matching polynomial and the reconstruction conjecture
zbMATH Open document ID: 0615.05045
DOI: 10.1155/S016117128700019X
author: E. J. Farrell
author: S. A. Wahid
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 1987-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/46162
review text: 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.
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 3995728
zbMATH Keywords: node reconstructibility
zbMATH Keywords: edge reconstructibility
zbMATH Keywords: matching polynomial
Wikidata QID: Q123241990
reviewed by: Thomas Andreae
MaRDI profile type: Publication
OpenAlex ID: W2097407042
Recommended article: Polynomial reconstruction of the matching polynomial
Recommended article: Some results and approaches for reconstruction conjectures
Recommended article: Q3684155
Recommended article: Q3724377
Recommended article: Some work towards the proof of the reconstruction conjecture
Recommended article: On reconstruction of polynomial automorphisms
Recommended article: The \(N\)-dimensional matching polynomial
Recommended article: Reconstruction Problems for Graphs, Krawtchouk Polynomials, and Diophantine Equations
Recommended article: Q4810409
description: scientific article; zbMATH DE number 3995728