An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial

DOI10.1016/j.jctb.2009.05.001zbMath1209.05183arXiv0806.4619OpenAlexW2025871027MaRDI QIDQ965239

Cheng Yeaw Ku, William Chen

Publication date: 21 April 2010

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

matching polynomialvertex transitive graphGallai-Edmonds structure theorem

Mathematics Subject Classification ID

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

Related Items (12)

THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH ⋮ Graphs with few matching roots ⋮ Extensions of barrier sets to nonzero roots of the matching polynomial ⋮ On matching integral graphs ⋮ Generalizing Tutte's theorem and maximal non-matchable graphs ⋮ Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy ⋮ Gallai-Edmonds structure theorem for weighted matching polynomial ⋮ Generalized \(D\)-graphs for nonzero roots of the matching polynomial ⋮ Further results on the largest matching root of unicyclic graphs ⋮ On the location of zeros of the Laplacian matching polynomials of graphs ⋮ Atoms of the matching measure ⋮ A refined Gallai-Edmonds structure theorem for weighted matching polynomials

Cites Work

• Matching theory
• The second largest eigenvalue of a tree
• Problems in algebraic combinatorics
• Algebraic matching theory
• Theory of monomer-dimer systems

This page was built for publication: An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial