Mathematics – Combinatorics
Scientific paper
2010-06-05
Mathematics
Combinatorics
34 pages, 5 figures
Scientific paper
In this paper, we prove the Gallai-Edmonds structure theorem for the most
general matching polynomial. 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. keywords:
Ku Cheng Yeaw
Wong Kok Bin
No associations
LandOfFree
Gallai-Edmonds Structure Theorem for Weighted Matching Polynomial does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Gallai-Edmonds Structure Theorem for Weighted Matching Polynomial, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gallai-Edmonds Structure Theorem for Weighted Matching Polynomial will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-638202