THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH

DOI10.17654/DM018040493MaRDI QIDQ5076247zbMATH OpenOpenAlexFDO

Authors Tingzeng Wu

Publication date 16 May 2022

Published in Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17654/dm018040493

zbMATH Keywords

matching polynomialdeficiencymatching root

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• Algebraic matching theory
• An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
• An introduction to matching polynomials
• Graphs with few matching roots
• Matching theory
• Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
• On the theory of the matching polynomial

Cited in

(1)

• scientific article; zbMATH DE number 6310920 (Why is no real title available?)

This page was built for publication: THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076247)