Generalized Permanental Polynomials of Graphs

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 PG(x, μ) = per(xI − (A(G)− μ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 PG(x, μ) in the coefficient form ∑ i=0 cμi(G)x n−i and obtain the combinatorial expressions for the first five coefficients cμi(G) (i = 0, 1, . . . , 4) of PG(x, μ).


Introduction
A graph invariant f is a function from the set of all graphs into any commutative ring, such that f has the same value for any two isomorphic graphs.Graph invariants can be used to check whether two graphs are not isomorphic.If a graph invariant f satisfies the condition that f (G) = f (H) implies G and H are isomorphic, then f is called a complete graph invariant.The problem of finding complete graph invariants is closely related to the graph isomorphism problem.Up to now, no complete graph invariant for general graphs has been found.However, some complete graph invariants have been identified for special cases and graph classes (see, for example, [1]).
Graph polynomials are graph invariants whose values are polynomials, which have been developed for measuring the structural information of networks and for characterizing graphs [2].Noy [3] surveyed results for determining graphs that can be characterized by graph polynomials.In a series of papers [1,[4][5][6], Dehmer et al. studied highly discriminating descriptors to distinguish graphs (networks) based on graph polynomials.In [5], it was found that the graph invariants based on the zeros of permanental polynomials are quite efficient in distinguishing graphs.Balasubramanian and Parthasarathy [7,8] introduced the bivariate permanent polynomial of a graph and conjectured that this graph polynomial is a complete graph invariant.In [9], Liu gave counterexamples to the conjecture by a computer search.
In order to find almost complete graph invariants, we introduce a graph polynomial by employing graph matrices and the permanent of a square matrix.We will see that this graph polynomial turns out to be quite efficient when we use it to distinguish graphs (networks).
The permanent of an n × n matrix M with entries m ij (i, j = 1, 2, . . ., n) is defined by where the sum is over all permutations σ of {1, 2, . . ., n}.Valiant [10] proved that computing the permanent is #P-complete, even when restricted to (0,1)-matrices.The permanental polynomial of M, denoted by π(M, x), is defined to be the permanent of the characteristic matrix of M; that is, where I n is the identity matrix of size n.
Let G = (V(G), E(G)) be a graph with adjacency matrix A(G) and degree matrix D(G).The Laplacian matrix and signless Laplacian matrix of G are defined by , respectively.The ordinary permanental polynomial of a graph G is defined as the permanental polynomial of the adjacency matrix A(G) of G (i.e., π(A(G), x)).We call π(L(G), x) (respectively, π(Q(G), x)) the Laplacian (respectively, the signless Laplacian) permanental polynomial of G.
The permanental polynomial π(A(G), x) of a graph G was first studied in mathematics by Merris et al. [11], and it was first studied in the chemical literature by Kasum et al. [12].It was found that the coefficients and roots of π(A(G), x) encode the structural information of a (chemical) graph G (see, e.g., [13,14]).Characterization of graphs by the permanental polynomial has been investigated, see [15][16][17][18][19].The Laplacian permanental polynomial of a graph was first considered by Merris et al. [11], and the signless Laplacian permanental polynomial was first studied by Faria [20].For more on permanental polynomials of graphs, we refer the reader to the survey [21].
We consider a bivariate graph polynomial of a graph G on n vertices, defined by It is easy to see that P G (x, µ) generalizes some well-known permanental polynomials of a graph G.For example, the ordinary permanental polynomial of G is P G (x, 0), the Laplacian permanental polynomial of G is (−1) |V(G)| P G (−x, 1), and the signless Laplacian permanental polynomial of G is P G (x, −1).We call P G (x, µ) the generalized permanental polynomial of G.
We can write the generalized permanental polynomial P G (x, µ) in the coefficient form The general problem is to achieve a better understanding of the coefficients of P G (x, µ).For any graph polynomial, it is interesting to determine its ability to characterize or distinguish graphs.A natural question is how well the generalized permanental polynomial distinguishes graphs.
The rest of the paper is organized as follows.In Section 2, we obtain the combinatorial expressions for the first five coefficients c µ0 , c µ1 , c µ2 , c µ3 , and c µ4 of P G (x, µ), and we compute the first five coefficients of P G (x, µ) for some specific graphs.In Section 3, 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 presented data shows that the generalized permanental polynomial is quite efficient in distinguishing graphs.It may serve as a powerful tool for dealing with graph isomorphisms.

Coefficients
In Section 2.1, we obtain a general relation between the generalized and the ordinary permanental polynomials of graphs.Explicit expressions for the first five coefficients of the generalized permanental polynomial are given in Section 2.2.As an application, we obtain the explicit expressions for the first five coefficients of the generalized permanental polynomials of some specific graphs in Section 2.3.

Relation between the Generalized and the Ordinary Permanental Polynomials
First, we present two properties of the permanent.Lemma 1.Let A, B, and C be three n × n matrices.If A, B, and C differ only in the rth row (or column), and the rth row (or column) of C is the sum of the rth rows (or columns) of A and B, then per(C) = per(A) + per(B).Lemma 2. Let M = (m ij ) be an n × n matrix.Then, for any i ∈ {1, 2, . . ., n}, where M(i, j) denotes the matrix obtained by deleting the ith row and jth column from M.
Since Lemmas 1 and 2 can be easily verified using the definition of the permanent, the proofs are omitted.
We need the following notations.
r 2 ,...,r k denotes the subgraph obtained by deleting vertices v r 1 , v r 2 , . . ., v r k from G. We use G[h r ] to denote the graph obtained from G by attaching to the vertex v r a loop of weight h r .Similarly, G[h r , h s ] stands for the graph obtained by attaching to both v r and v s loops of weight h r and h s , respectively.Finally, G[h 1 , h 2 , . . ., h n ] is the graph obtained by attaching a loop of weight h r to vertex v r for each r = 1, 2, . . ., n.The adjacency matrix By Lemmas 1 and 2, expanding along the rth column, we can obtain the recursion relation For example, expanding along the first column of π(A(G[h 1 ]), x), we have By repeated application of (1) for G[h r , h s ], we have Additional iterations can be made to take into account loops on additional vertices.For loops on all n vertices, the expression becomes (2) We see that the generalized permanental polynomial Hence, we obtain a relation between the generalized and ordinary permanental polynomials as an immediate consequence of (2).
Theorem 1.Let G be a graph on n vertices.Then, Theorem 1 was inspired by Gutman's method [22] for obtaining a general relation between the Laplacian and the ordinary characteristic polynomials of graphs.From Theorem 1, one can easily give a coefficient formula between the generalized and the ordinary permanental polynomials.

The First Five Coefficients of P G (x, µ)
In what follows, we use t G and q G to denote respectively the number of triangles (i.e., cycles of length 3) and quadrangles (i.e., cycles of length 4) of G, and t G (v) denotes the number of triangles containing the vertex v of G.
Liu and Zhang [15] obtained combinatorial expressions for the first five coefficients of the permanental polynomial of a graph.

Lemma 3 ([15]
).Let G be a graph with n vertices and m edges, and let (d Theorem 3. Let G be a graph with n vertices and m edges, and let (d 1 , d 2 , . . ., d n ) be the degree sequence of G.
Proof.It is obvious that c µ0 (G) = 1.By Theorem 2 and Lemma 3, we have (3) By a straightforward calculation, we have and Substituting ( 4) and ( 5) into (3), we obtain This completes the proof.

Corollary 1.
Let G be a graph with n vertices and m edges, and let (d 1 , d 2 , . . ., d n ) be the degree sequence of G. Suppose that π(L(G), x) = ∑ n i=0 p i (G)x n−i , then Corollary 2. Let G be a graph with n vertices and m edges, and let (d

Examples
In this subsection, by applying Theorem 3, we obtain the first five coefficients of the generalized permanental polynomials of some specific graphs: Paths, cycles, complete graphs, complete bipartite graphs, star graphs, and wheel graphs.
Example 1.Let P n (n ≥ 3) be the path on n vertices.We see at once that t P n = q P n = 0, and t P n (v) = 0 for each vertex v of P n .By Theorem 3, we have Example 2. Let C n (n ≥ 5) be the cycle on n vertices.We see at once that t C n = q C n = 0, and t C n (v) = 0 for each vertex v of C n .By Theorem 3, we have Example 3. Let K n (n ≥ 4) be the complete graph on n vertices.It is easy to check that t be the complete bipartite graph with partition sets of sizes a and b.We see Example 5. Let S n (n ≥ 3) be the star graph with n + 1 vertices and n edges.We see at once that t S n = q S n = 0, and t S n (v) = 0 for each vertex v of S n .By Theorem 3, we have Example 6.Let W n (n ≥ 5) be the wheel graph with n + 1 vertices and 2n edges.It is obvious that t W n = q W n = n.Let v 0 be the hub (i.e., the vertex of degree n) of W n .We see that t W n (v 0 ) = n and t W n (v) = 2 for other vertices v of W n .By Theorem 3, we have

Numerical Results
In this section, by computer we enumerate 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.
Two graphs G and H are said to be generalized co-permanental if they have the same generalized permanental polynomial.If a graph H is generalized co-permanental but non-isomorphic to G, then H is called a generalized co-permanental mate of G.
In order to compute the generalized permanental polynomials of graphs, we, first of all, have to generate the graphs by computer.We use nauty and Traces [23] to generate all graphs on at most 10 vertices.Next, the generalized permanental polynomials of these graphs are calculated by a Maple procedure.Finally, we count the numbers of generalized co-permanental graphs.
The results are summarized in Table 1.Table 1 lists, for n ≤ 10, the total number of graphs on n vertices, the total number of distinct generalized permanental polynomials of such graphs, the number of such graphs with a generalized co-permanental mate, the fraction of such graphs with a generalized co-permanental mate, and the size of the largest family of generalized co-permanental graphs.
In Table 1, we see that the smallest generalized co-permanental graphs, with respect to the order, contain 10 vertices.Even more striking is that out of 12,005,168 graphs with 10 vertices, only 106 graphs could not be discriminated by the generalized permanental polynomial.

Conclusions
This paper is a continuance of the research relating to the search of almost-complete graph invariants.In order to find an almost-complete graph invariant, we introduce the generalized permanental polynomials of graphs.As can be seen, the generalized permanental polynomial is quite efficient in distinguishing graphs (networks).It may serve as a powerful tool for dealing with graph isomorphisms.We also obtain the combinatorial expressions for the first five coefficients of the generalized permanental polynomials of graphs.

Table 1 .
Graphs on at most 10 vertices.