On the permanental sum of graphs

摘要

Let G be a graph and A(G) the adjacency matrix of G. The polynomial π(G,x)=per(xI−A(G)) is called the permanental polynomial of G, and the permanental sum of G is the summation of the absolute values of the coefficients of π(G, x). In this paper, we investigate properties of permanental sum of a graph, prove recursive formulas to compute the permanental sum of a graph, and show that the ordering of graphs with respect to permanental sum. Furthermore, we determine the upper and lower bounds of permanental sum of unicyclic graphs, and the corresponding extremal unicyclic graphs are also determined.