The Relationship between the Permanental Polynomial and theMatching Polynomial of Graphs

令G是一个简单图,A(G)为图G的邻接矩阵.那么矩阵A(G)的永久和记为PS(A(G))，矩阵A(G)的积和多项式记为per(xI-A(G)).在本文中, 我们利用匹配多项式及其补图之间的相互关系，证明了图的积和多项式与其补图匹配多项式之间的关系；并且通过这个我们推导出了几乎完全图的永久和与其补图匹配数之间的具体关系.Let G be a simple graph, and A(G) be the adjacency matrix of graph G. The permanent sum of matrix A(G) is denoted as P S(A(G)), and the permanental polynomial of matrix A(G) is denoted as per(xI − A(G)). In this paper, we utilize the interrelation between the matching polynomial and its complement graph to demonstrate the relationship between the permanental polynomial of a graph and the matching polynomial of its complement graph. Furthermore, through this approach, we deduce the specific re-lationship between the permanent sum of already complete graphs and the matching number of their complement graphs.