Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 3, No 1 (2015): Electronic Journal of Graph Theory and Applications

Polynomial reconstruction of the matching polynomial

Xueliang Li (Center for Combinatorics, Nankai University, Tianjin)
Yongtang Shi (Center for Combinatorics, Nankai University, Tianjin)
Martin Trinks (Center for Combinatorics, Nankai University, Tianjin)

Article Info

Publish Date
22 Mar 2015

Abstract

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.

Copyrights © 2015




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Electronic Journal of Graph Theory and Applications (EJGTA)
Website

Abbrev

ejgta

Publisher

Indonesian Combinatorial Society

Subject

Electrical & Electronics Engineering

Description

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society ...