




















In this work, we prove a refinement of the Gallai-Edmonds structure theorem for weighted matching polynomials by Ku and Wong. Our proof uses a connection between matching polynomials and branched continued fractions. We also show how this is related to a modification by Sylvester of the classical Sturm's theorem on the number of zeros of a real polynomial in an interval. In addition, we obtain some other results about zeros of matching polynomials.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。