Polynomial reconstruction of the matching polynomial

Xueliang Li, Yongtang Shi, Martin Trinks


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


reconstruction, matching polynomial, perfect matching

Full Text:


DOI: http://dx.doi.org/10.5614/ejgta.2015.3.1.4


  • There are currently no refbacks.

ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats