The Characteristic Polynomials of Symmetric Graphs

: In this paper, we study the way the symmetries of a given graph are reﬂected in its characteristic polynomials. Our aim is not only to ﬁnd obstructions for graph symmetries in terms of its polynomials but also to measure how faithful these algebraic invariants are with respect to symmetry. Let p be an odd prime and Γ be a ﬁnite graph whose automorphism group contains an element h of order p . Assume that the ﬁnite cyclic group generated by h acts semi-freely on the set of vertices of Γ with ﬁxed set F . We prove that the characteristic polynomial of Γ , with coefﬁcients in the ﬁnite ﬁeld of p elements, is the product of the characteristic polynomial of the induced subgraph Γ [ F ] by one of Γ \ F . A similar congruence holds for the characteristic polynomial of the Laplacian matrix of Γ .


Introduction
The purpose of this paper is to address the question of how the symmetries of a graph are reflected in its algebraic invariants. In other words, we study the interaction between the algebraic invariants of a graph and its automorphism group. Indeed, our study will be limited to discussing how the information about graph periodicity is carried by its characteristic polynomials. This question is primarily motivated by the results about knots and spatial graph periodicity obtained in terms of their quantum invariants. We shall start by fixing some notation. Let n be a positive integer and V = {v 1 , . . . , v n } be a finite set. A weight on V is a symmetric function w: V × V → Z + ∪ {0}. The pair Γ = (V, w) is called a weighted graph. Indeed, a weighted graph can be seen as a finite graph possibly with multiple edges and loops. In particular, if the graph Γ is simple, then the corresponding symmetric function w is defined by w(u, v) = 1 if u and v are adjacent and 0 otherwise. Throughout this paper, wherever no confusion may arise, we will simplify notation and use the term graph instead of weighted graph. Given a graph Γ with vertex set V = {v 1 , . . . , v n }, the adjacency matrix of Γ is the n-square matrix A(Γ) = [w ij ] where w ij = w(v i , v j ). Since the weight function w is symmetric, so is the matrix A(Γ). It is worth mentioning here that while the matrix A(Γ) depends on the ordering of the vertices, its characteristic polynomial, defined as det(xI n − A(Γ)), is known to be independent of that order. It is denoted hereafter by ϕ Γ (x). On the other hand, if D(Γ) = [d ij ] is the degree matrix of Γ, which is the diagonal n-square matrix defined by d ii = deg(v i ), then the Laplacian matrix of Γ is defined by L(Γ) = D(Γ) − A(Γ). The characteristic polynomial of L(Γ) is also independent of the ordering of the vertices and is denoted hereafter by ψ Γ (x). Both polynomials ϕ Γ (x) and ψ Γ (x) are well-known graph invariants which carry important information about the graph.
An automorphism of a weighted graph Γ is a permutation σ of the set of vertices V such that for any pair of vertices u and v, we have w(σ(u), σ(v)) = w(u, v). The set of all automorphisms of Γ forms a group denoted here by Aut(Γ).
Let p ≥ 2 be an integer. A graph Γ is said to be p-periodic if its automorphism group Aut(Γ) contains an element h such that h p = Id and for any vertex v, we have h i (v) = v for all 1 ≤ i ≤ p − 1. In other words, the finite cyclic group Z p acts freely on the set of vertices of the graph. A graph Γ is said to be semi-free p-periodic if Aut(Γ) contains an element h such that h p = Id and the set of fixed vertices by h is non empty. This set of fixed vertices will be denoted hereafter by F. It is worth mentioning here that for simplicity we will sometimes abuse notation and denote by F the induced subgraph Γ[F] as well. Notice that if Γ is semi-free p-periodic then Γ \ F is p-periodic.
Let r and s be two positive integers. The complete 4-partite graph K r,s,p,p is semi-free p-periodic with fixed subgraph F the complete bipartite graph K r,s . The graph Γ \ F is the complete bipartite graph K p,p .
Given a p-periodic weighted graph Γ, we define its quotient graph Γ as the weighted graph (V, w), where V is the quotient set of V under the action of h and w is the weight function on V defined by The natural question of how the information about symmetries of graphs are carried by their algebraic invariants has been subject to relatively extensive study. In particular, several results about the characteristic polynomial of periodic graphs and graph coverings in general have been obtained, see [2][3][4] for instance. In [1], the first author suggested a more elementary approach by considering these polynomials with coefficients in the finite field of p elements F p . Actually, he studied the characteristic polynomial of p-periodic graphs and proved that ϕ Γ (x) is determined by the characteristic polynomial of the quotient graph Γ. More precisely, . Other necessary conditions for a graph to be p-periodic have been also obtained in terms of the Tutte polynomial and its generalizations [1,5]. In this paper, we discuss the case of semi-free actions and show that some similar congruences hold. Theorem 1. Let p be an odd prime and Γ be a semi-free p-periodic graph with a fixed subgraph F. Then the following congruences hold in F p [x].

Theorem 2.
Let p be an odd prime and Γ be a semi-free p-periodic graph with a fixed subgraph F.

Block Circulant Matrices
In this section we will introduce block circulant matrices and briefly explain how to compute their characteristic polynomials. More details can be found in [6]. Let p and s be two positive integers.
The characteristic polynomial of the circulant matrix C, with coefficients in the finite filed F p , satisfies the following property. Lemma 1. Let p be an odd prime and C = C(A 0 , . . . , A p−1 ) be a block circulant matrix. Then, Proof. Let ζ be a p th primitive root of unity. For 0 ≤ k ≤ p − 1, we define the s-square matrix [6]. Since p is prime, the following homomorphism is well defined: This completes the proof of the lemma.
Let Γ be a semi-free p-periodic graph with fixed set of vertices F. Assume that F is made up of r vertices u 1 , u 2 , . . . , u r . Since p is prime and Γ \ F is p-periodic, the finite cyclic group Z p =< h > acts freely on the set of vertices of Γ \ F. This set splits into a partition made up of s orbits, where s is the number of vertices of the quotient graph Γ \ F. Since the action is free and p is prime, each orbit is made up of exactly p elements. Let us label the vertices of Γ \ F as v 1 , . . . , v s . Let π be the canonical surjection from V \ F to V \ F. We label the elements of . Notice that for all 1 ≤ i ≤ r, 1 ≤ k, k ≤ s and 0 ≤ j ≤ p − 1, we have : Consequently, if we consider the order of the vertices of Γ obtained by placing the vertices of F first then those of Γ \ F in the order described above, then the adjacency matrix of Γ is of the following form: where A(F) denotes the adjacency matrix of the subgraph F, R is an r × s-matrix and for 0 ≤ i ≤ p − 1, A i is a s-square matrix. Notice that the block circulant sub-matrix (A 0 , A 1 , . . . , A p−1 ) is indeed the adjacency matrix of the periodic graph Γ \ F. For instance the adjacency matrix of the semi-free 3-periodic graph displayed in Figure 1 is of the form.

Proofs
We will first prove Theorem 1. The proof of Theorem 2 will be based on similar arguments. Let us compute the characteristic polynomial of Γ, det(A(Γ) − xI n ) by expanding with respect to the first row. The basic observation here is that since w(u 1 , h m (v j k )) = w(u 1 , v j k ) for 1 ≤ m ≤ p, the co-factors corresponding to each of these p entries are equal. Hence their contribution to the value of det(A(Γ) − xI n ) will add to zero modulo p. We will prove that for the co-factors which correspond to deleting the first row of A(Γ) and the columns r + 1, r + s + 1, . . . , r + (p − 1)s + 1 of A(Γ). The sub-matrices obtained by such operations will be denoted hereafter by ∆ r+1 , ∆ r+s+1 , . . . , ∆ r+(p−1)s+1 , respectively. These sub-matrices are displayed below.
where, S is the matrix obtained from R by deletion of the first row. Moreover, if M is a matrix, then we denote by M the matrix obtained from M by deletion of the first column. Let us explain how to transform the first matrix ∆ r+1 into ∆ r+s+1 using elementary operations on rows and columns. These operations are known to keep the determinant unchanged up to a sign. First, we interchange column r + i and r + s + i for all 1 ≤ i ≤ s − 1, then we apply s − 1 column interchanges to move column r + 2s − 1 to column r + s, our matrix is then transformed into: Now, we shall rearrange rows using elementary row operations. Indeed, using (p − 1)s interchanges of rows we will be able to transform our matrix into: By interchanging column r + i and column r + p(s − 1) + i − 1, for 1 ≤ i ≤ s, we obtain: Finally, we can perform (p − 3)s column operations to rearrange the matrix into the desired form: Notice that the total number of rows and columns interchanges performed to transform ∆ r+1 into ∆ r+s+1 is 2(s − 1) Similarly, one can show that |∆ r+1 | = (−1) ms |∆ r+ms+1 |, for 1 ≤ m ≤ p − 1. It can be easily checked that Hence, the contributions of these p sub-matrices to the value of the determinant add to zero modulo p. Consequently, to compute the ϕ Γ (x) modulo p, one may consider only the co-factors corresponding to entries in the first row of F. With an elementary induction argument on the size of F, we can prove that ϕ Γ (x) ≡ ϕ F (x)ϕ Γ\F (x) modulo p. Notice that since Γ \ F is a p-periodic graph, we have ϕ Γ\F (x) ≡ ϕ Γ\F (x p ) modulo p, as proven in [1]. This completes the proof of Theorem 1.
The proof of Theorem 2 is also based on the study of block circulant matrices. Using the order of the vertices described above, the Laplacian matrix of Γ is of the form: where l(F) is an r-square matrix, M is an r × s-matrix and for 0 ≤ i ≤ p − 1, B i is a s-square matrix. In a similar way, we can prove that det(L(Γ) − xI n ) is the product of det(l(F) − xI n ) by det(C(B 0 , . . . , B p−1 ) − xI n ). On the other hand, it can be easily seen that l(F) and L(F) coincide out of the diagonal. Furthermore, for any i, the diagonal entries are congruent modulo p, d ii (l(F)) ≡ d ii (L(F)) modulo p. Thus, det(l(F) − xI n ) ≡ det(L(F) − xI n ) modulo p. Consequently, ψ F (x) divides ψ Γ (x) in F p [x]. Finally, by Lemma 1 det(C(B 0 , . . . , B p−1 ) − xI n ) is a polynomial on x p . This ends the proof of Theorem 2.

Conclusions
By using elementary properties of block circulant matrices, we established two obstruction criteria for a graph to be symmetric. More precisely, we proved that if a given graph Γ is semi-free p-periodic with set of fixed vertices F, then its characteristic polynomial, with coefficients reduced modulo p, is the product of the characteristic polynomial of the induced subgraph Γ[F] by the one of Γ \ F. We also proved that the characteristic polynomial of the Laplacian matrix of a semi-free p-periodic graph satisfies a similar necessary condition.

Conflicts of Interest:
The authors declare no conflict of interest.