THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH

DOI10.17654/DM018040493zbMATH Open1499.05324OpenAlexW2768941505MaRDI QIDQ5076247FDOQ5076247

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Matching theory
• On the theory of the matching polynomial
• An introduction to matching polynomials
• Algebraic matching theory
• Graphs with few matching roots
• An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
• Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover

Cited In (1)

• Title not available (Why is that?)

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)