Polynomial reconstruction of the matching polynomial

The matching polynomial of a graph is the generating function of the numbers of its matchingswith respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value fora graph can be determined from its values for the vertex-deleted subgraphs of the same graph. Thisnote discusses the polynomial reconstructibility of the matching polynomial. We collect previousresults, prove it for graphs with pendant edges and disprove it for some graphs.