Gallai–Edmonds structure theorem for weighted matching polynomial

In this paper, we prove the Gallai–Edmonds structure theorem for weighted matching polynomials. Our result implies the Parter–Wiener theorem and its recent generalization about the existence of principal submatrices of a Hermitian matrix whose graph is a tree.