Polynomial reconstruction of the matching polynomial

DOI10.5614/ejgta.2015.3.1.4zbMath1467.05131arXiv1404.3469OpenAlexW1992008782MaRDI QIDQ5006550

Martin Trinks, Yongtang Shi, Xue Liang Li

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.3469

zbMATH Keywords

reconstructionperfect matchingmatching polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

The idiosyncratic polynomial of digraphs ⋮ The matching polynomials of hypergraphs and weighted hypergraphs ⋮ A note on \(m\)-near-factor-critical graphs

Cites Work

• The enumeration of vertex induced subgraphs with respect to the number of components
• A congruence theorem for trees
• Matching theory
• Hermite polynomials and a duality relation for matchings polynomials
• An introduction to matching polynomials
• A unified approach to the first derivatives of graph polynomials
• On the reconstruction of the matching polynomial and the reconstruction conjecture
• Reconstructing subgraph-counting graph polynomials of increasing families of graphs
• Matchings and walks in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item