Generalized \(D\)-graphs for nonzero roots of the matching polynomial

DOI10.1016/j.disc.2011.07.004zbMath1228.05182arXiv0909.5266MaRDI QIDQ641190

Cheng Yeaw Ku, Kok Bin Wong

Publication date: 21 October 2011

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

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

zbMATH Keywords

matching polynomial; extreme sets; Gallai-Edmonds decomposition; \(D\)-graphs; Tutte 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, Extensions of barrier sets to nonzero roots of the matching polynomial, Gallai-Edmonds structure theorem for weighted matching polynomial

Cites Work

• Extensions of barrier sets to nonzero roots of the matching polynomial
• Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
• 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
• Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
• Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
• Generalizing \(D\)-graphs
• Theory of monomer-dimer systems
• Tutte sets in graphs I: Maximal tutte sets and D-graphs