Extensions of barrier sets to nonzero roots of the matching polynomial

DOI10.1016/j.disc.2010.09.002zbMath1200.05109arXiv0909.5249MaRDI QIDQ607015

Kok Bin Wong, Cheng Yeaw Ku

Publication date: 19 November 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matching polynomial; extreme sets; Gallai-Edmonds decomposition; barrier sets

Mathematics Subject Classification ID

05C31: Graph polynomials

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

Related Items

Generalizing Tutte's theorem and maximal non-matchable graphs, Generalized \(D\)-graphs for nonzero roots of the matching polynomial, Gallai-Edmonds structure theorem for weighted matching polynomial

Cites Work

• Generalizing Tutte's theorem and maximal non-matchable graphs
• Properties of \(\theta\)-super positive graphs
• Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
• Generalized \(D\)-graphs for nonzero roots of the matching polynomial
• An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
• Matching theory
• Problems in algebraic combinatorics
• Algebraic 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