【摘要】 本文研究了图的匹配多项式最多带有两个正匹配根的图的刻画.利用一个图恰有两个正匹配根当且仅当它有2匹配,但没有3匹配的事实,通过计算图上的匹配数,得到了匹配多项式最多带有两个正匹配根的所有图.更多还原

【Abstract】 In this paper, we study the characterizing of the graphs determined by the matching polynomials with at most two positive roots. Using the fact that a graph G has exactly two positive matching roots if and only if it has 2-matching but not 3-matching, by calculating the matching number of the graphs, we obtain all graphs with at most two positive roots for the matching polynomials.更多还原