Generalized permanental polynomials of graphs (Q2311039): Difference between revisions

Summary: The search for complete graph invariants is an important problem in graph theory and computer science. Two networks with a different structure can be distinguished from each other by complete graph invariants. In order to find a complete graph invariant, we introduce the generalized permanental polynomials of graphs. Let \(G\) be a graph with adjacency matrix \(A(G)\) and degree matrix \(D(G)\). The generalized permanental polynomial of \(G\) is defined by \(P_G(x, \mu) = \operatorname{per}(x I -(A(G) - \mu D(G)))\). In this paper, we compute the generalized permanental polynomials for all graphs on at most 10 vertices, and we count the numbers of such graphs for which there is another graph with the same generalized permanental polynomial. The present data show that the generalized permanental polynomial is quite efficient for distinguishing graphs. Furthermore, we can write \(P_G(x, \mu)\) in the coefficient form \(\sum_{i = 0}^n c_{\mu i}(G) x^{n - i}\) and obtain the combinatorial expressions for the first five coefficients \(c_{\mu i}(G)\) (\(i = 0, 1, \ldots, 4\)) of \(P_G(x, \mu)\).