Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover

zbMath1230.05168arXiv0810.4986MaRDI QIDQ2380236

Cheng Yeaw Ku, Kok Bin Wong

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (6)

THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH ⋮ Extensions of barrier sets to nonzero roots of the matching polynomial ⋮ Generalizing Tutte's theorem and maximal non-matchable graphs ⋮ Gallai-Edmonds structure theorem for weighted matching polynomial ⋮ Generalized \(D\)-graphs for nonzero roots of the matching polynomial ⋮ On the largest matching roots of graphs with cut edges

This page was built for publication: Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover