Title of article
Polynomial reconstruction of the matching polynomial
Author/Authors
Li, Xueliang Nankai University - Center for Combinatorics, China , Shi, Yongtang Nankai University - Center for Combinatorics, China , Trinks, Martin Nankai University - Center for Combinatorics, China
From page
27
To page
34
Abstract
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.
Keywords
reconstruction , matching polynomial , perfect matching
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Record number
2621235
Link To Document