Throughout this paper, we consider finite undirected simple graphs and follow the notation and terminology of [1] .

Let G be a simple graph with n vertices. We use A(G) and $S\left(G\right)=J-I-2A\left(G\right)$ to denote the adjacency matrix and the Seidel matrix of G, respectively. Let ${\lambda }_1,{\lambda }_2,\cdots ,{\lambda }_n$ be n distinct eigenvalues of $S_G\left(\lambda \right)$ with the corresponding multiplicities $k_1,k_2,\cdots ,k_n$. We denote the Seidel spectrum of G as $\text{Spec}\left(G\right)=\left\{{\lambda }_1^{k_1},{\lambda }_2^{k_2},\cdots ,{\lambda }_n^{k_n}\right\}$. A graph is called an integral graph when all of its eigenvalues are integers. The eigenvalues of A(G) (resp., S(G)) will be referred to as eigenvalues (resp., Seidel eigenvalues) of G.

The research of graph theory originated in 1957 and was mentioned by L. Collatz and U. Sinogowitz in reference [2] . The spectrum of a graph characterizes some structural properties of the graph, which plays an important role in the research of other problems. In particular, it is closely related to the energy of the graph and the indices of the graph. The concept of integral graphs was first introduced by F. Harary and A. J. Schwenk [3] in 1973. They showed that if a graph is integral, then its complement and line graphs are also integral. Furthermore, if $G_1$ and $G_2$ are two integral graphs, their union, join, Cartesian product, and strong product graphs are also integral. Additionally, they characterized certain cases of integral trees.

Since then, much attention has been paid to this topic, but they mainly focus on undirected graphs and integral trees.

Theorem1.1 (Lv Shengmei [4] ) The Seidel eigenvalues polynomial and its spectrum for the complete graph are given, and it is proven that the complete graph is a Seidel integral graph.

Theorem1.2 (Lv Shengmei [5] ) All trees with a diameter of 2 are Seidel integral trees, and the sufficient and necessary conditions for a tree with a diameter of 3 to be a Seidel integral tree have been provided.

In order to study the problem of equiangular line systems in Euclidean space, Van Lint and Seidel introduced the concept of the Seidel matrix of a graph G in [6] . This problem has also been widely studied.

The adjacency matrix of G is $A=A\left(G\right)={\left(a_{ij}\right)}_{n\times n}$, which is an n-order square matrix. Its definition is as follows:

$a_{ij}=\{\begin{array}{ll}1\hfill & v_i~v_j\hfill \\ 0\hfill & v_i\ne v_j\hfill \end{array}$, where $a_{ii}=0$， $a_{ij}=a_{ji}$

Therefore, $A\left(G\right)$ is a real symmetric matrix.

Let $A\left(G\right)$ be the (0, 1) adjacency matrix of G. The Seidel matrix of G, is defined as $S\left(G\right)=J-I-2A\left(G\right)$. The Seidel eigenvalues polynomial of G is $S_G\left(\lambda \right)=\det \left(\lambda I-S\left(G\right)\right)$, which can be written as $S_G\left(\lambda \right)=s_0{\lambda }^n+s_1{\lambda }^{n-1}+\cdots +s_n{\lambda }^0$，where J is the all-one matrix and I is the identity matrix.

In 2008, Zeng in [7] proved the main eigenvalue of the Seidel matrix can be obtained from the principal eigenvalue and the corresponding eigenvector of its adjacency matrix.

Theorem 1.3 (Zeng Changxiong [7] ) Let ${\lambda }_1,{\lambda }_2,\cdots ,{\lambda }_n$ be the main eigenvalues of $A\left(G\right)$, $a_1,a_2,\cdots ,a_m$ be the corresponding unit orthogonal vectors.

In 2014, Wang et al. presented in [8] the necessary and sufficient conditions for a complete multipartite graph to be a Seidel integral graph, and also constructed some Seidel integral graphs. Berman et al. in [9] gave the sufficient conditions for a complete multipartite graph determined by the Seidel spectrum under the Seidel transformation. Greaves in [10] gave the necessary and sufficient conditions for a graph with exactly three distinct Seidel eigenvalues to be a regular graph. In [11] , Haemers studied the Seidel energy of graphs and proposed a conjecture about the lower bound of the Seidel energy: for all graphs G with n vertices, the complete graph has the minimum Seidel energy.

Another interesting problem in the spectral theory of graphs is whether the spectrum of a graph can be predicted based on its structure. This problem can be solved by using various operations on graphs. Up to now, graph spectrum theory has yielded many results, yet most of them are related to the Adjacency eigenvalue polynomial and its spectrum, the Laplacian eigenvalue polynomial and its spectrum, and the Signless Laplacian eigenvalue polynomial and its spectrum [12] . There are relatively few results on the research of the Seidel eigenvalue polynomial and its spectrum, and the main references found in [4] - [15] .

The Petersen graph ( Figure 1 ) is the simple graph whose vertices are the 2-element subsets of a 5-element set and whose edges are the pairs of disjoint 2-element subsets.

The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. The energy of a graph is related to the eigenvalues of the graph, that is, it is related to the graph spectrum. Haemers defined in [11] the Seidel energy as the sum of the absolute values of the eigenvalues of the Seidel matrix. Besides, he also proved the upper and lower bounds of the Seidel energy and proposed a conjecture that among all graphs with n vertices, the complete graph $K_n$ has the minimum Seidel energy. This conjecture was proved to be true for $n\le 10$ by Robin Swinkels.

Based on the previous results, we want to consider the Seidel eigenvalues of the Petersen graph class. However, when each vertex of the Petersen graph is replaced by a cycle, the structure of the graph becomes complex and the Seidel matrix grows extremely large, which requires the aid of algorithms to solve. Thus, in this paper, we mainly characterized the Seidel polynomial and spectrum of the Petersen graph.

Theorem 1.4 Let G be the Petersen graph, then the Seidel eigenvalues polynomial of the graph G is

$S_G\left(\lambda \right)={\lambda }^{10}-45{\lambda }^8+818{\lambda }^6-7218{\lambda }^4+324{\lambda }^3+32805{\lambda }^2+5.1\times {10}^{-12}\lambda -59049.$

Theorem 1.5 Let G be the Petersen graph, then G is a Seidel integral graph.

In this section, we propose several essential preliminary lemmas, which are very useful for the proof of our main result.

Definition 2.1 (Huang Youdu, Di Chengen, Zhu Shixin [10] ). In an n order square matrix $A=\left(a_{ij}\right)$, arbitrarily select k rows and k columns with the same row and column indices ( $1\le k\le n$). The sum of the k order determinants composed of $k^2$ elements, located at the intersections of these k rows and k columns in their original positions , is called the k order trace of the square matrix A, denoted as $t{r}^{\left[k\right]}\left(A\right)$, that is,

$t{r}^{\left[k\right]}\left(A\right)={\displaystyle {\sum }_{1\le i_1<i_2<\cdots <i_k\le n}\left|\begin{array}{ccc}{a}_{i_1{i}_1}& \cdots & a_{i_1{i}_k}\\ ⋮& \ddots & ⋮\\ a_{i_k{i}_1}& \cdots & a_{i_k{i}_k}\end{array}\right|}\left(k=1,2,\cdots ,n\right)$ (1)

where, $a_{i_t{i}_s}$ ( $1\le i_t,i_s\le n$, $t,s=1,2,\cdots ,k$; $i_1<i_2<\cdots <i_k$) , it is the element located at the intersection of the $i_t$ row and the $i_s$ column in A.

The k order trace of an n order square matrix, $t{r}^{\left[k\right]}\left(A\right)$ is the sum of $C_n^k$ determinants of order k.

According to Equation (1), we can obtain that:

$t{r}^{\left[1\right]}\left(A\right)={\displaystyle {\sum }_{i=1}^n{a}_{ii}}=a_{11}+a_{22}+\cdots +a_{nn}$;

$\begin{array}{c}t{r}^{\left[2\right]}\left(A\right)={\displaystyle {\sum }_{1\le i<j\le n}\left|\begin{array}{cc}{a}_{ii}& a_{ij}\\ a_{ji}& a_{jj}\end{array}\right|}\\ =\left|\begin{array}{cc}{a}_{11}& a_{12}\\ a_{21}& a_{22}\end{array}\right|+\left|\begin{array}{cc}{a}_{11}& a_{13}\\ a_{31}& a_{33}\end{array}\right|+\cdots +\left|\begin{array}{cc}{a}_{11}& a_{1n}\\ a_{n1}& a_{nn}\end{array}\right|+\cdots +\left|\begin{array}{cc}{a}_{n-1,n-1}& a_{n-1,n}\\ a_{n,n-1}& a_{n,n}\end{array}\right|;\end{array}$

$\begin{array}{c}t{r}^{\left[3\right]}\left(A\right)={\displaystyle {\sum }_{1\le i_1<i_2<i_3\le n}\left|\begin{array}{ccc}{a}_{i_1{i}_1}& a_{i_1{i}_2}& a_{i_1{i}_3}\\ a_{i_2{i}_1}& a_{i_2{i}_2}& a_{i_2{i}_3}\\ a_{i_3{i}_1}& a_{i_3{i}_2}& a_{i_3{i}_3}\end{array}\right|}\\ =\left|\begin{array}{ccc}{a}_{11}& a_{12}& a_{13}\\ a_{21}& a_{22}& a_{23}\\ a_{31}& a_{32}& a_{33}\end{array}\right|+\left|\begin{array}{ccc}{a}_{11}& a_{14}& a_{15}\\ a_{41}& a_{44}& a_{45}\\ a_{51}& a_{54}& a_{55}\end{array}\right|+\cdots +\left|\begin{array}{ccc}{a}_{11}& a_{1,n-1}& a_{1,n}\\ a_{n-1,1}& a_{n-1,n-1}& a_{n-1,n}\\ a_{n,1}& a_{n,n-1}& a_{nn}\end{array}\right|\\ +\cdots +\left|\begin{array}{ccc}{a}_{n-1,n-1}& a_{n-1,n}& a_{n-1,n+1}\\ a_{n,n-1}& a_{n,n}& a_{n,n+1}\\ a_{n+1,n-1}& a_{n+1,n}& a_{n+1,n+1}\end{array}\right|\end{array}$

In the same way, we can get:

$t{r}^{\left[n\right]}\left(A\right)=\left|\begin{array}{ccc}{a}_{11}& \cdots & a_{1n}\\ ⋮& \ddots & ⋮\\ a_{n1}& \cdots & a_{nn}\end{array}\right|=\left|A\right|$

Lemma 2.2 (Huang Youdu, Di Chengen, Zhu Shixin [16] ). The eigenvalues polynomial $f\left(\lambda \right)=\left|\lambda I-A\right|$ of the n order square matrix A, can be written in the following form:

$f\left(\lambda \right)=\underset{k=1}{\overset{n}{{\displaystyle \sum }}}{\left(-1\right)}^{k}t{r}^{\left[k\right]}\left(A\right){\lambda }^{n-k}$

where, $t{r}^{\left[0\right]}\left(A\right)=1$, $t{r}^{\left[k\right]}\left(A\right)={\displaystyle {\sum }_{1\le i_1<i_2<\cdots <i_k\le n}\left|\begin{array}{ccc}{a}_{i_1{i}_1}& \dots & a_{i_1{i}_k}\\ ⋮& \ddots & ⋮\\ a_{i_k{i}_1}& \dots & a_{i_k{i}_k}\end{array}\right|}$ ( $k=1,2,\cdots ,n$).

For the convenience of subsequent calculations, we use $m\left(t{r}^{\left[k\right]}\left(A\right)\right)$ to represent the number of $t{r}^{\left[k\right]}\left(A\right)$.

In what follows, we verify Theorem 1.4.

Proof of Theorem 1.4. Let G be the Petersen graph ( Figure 1 ), then $A\left(G\right)$ be the (0, 1) adjacency matrix of the Petersen graph.

$A\left(G\right)=\left(\begin{array}{ccc}\begin{array}{ccc}0& 1& 1\\ 1& 0& 0\\ 1& 0& 0\end{array}& \begin{array}{ccc}0& 0& 1\\ 1& 0& 0\\ 0& 1& 0\end{array}& \begin{array}{cc}\begin{array}{cc}0& 0\\ 1& 0\\ 0& 1\end{array}& \begin{array}{cc}0& 0\\ 0& 0\\ 0& 0\end{array}\end{array}\\ \begin{array}{ccc}0& 1& 0\\ 0& 0& 1\\ 1& 0& 0\end{array}& \begin{array}{ccc}0& 1& 0\\ 1& 0& 0\\ 0& 0& 0\end{array}& \begin{array}{cc}\begin{array}{cc}0& 0\\ 0& 0\\ 0& 0\end{array}& \begin{array}{cc}1& 0\\ 0& 1\\ 1& 1\end{array}\end{array}\\ \begin{array}{c}\begin{array}{ccc}0& 1& 0\\ 0& 0& 1\\ 0& 0& 0\end{array}\\ \begin{array}{ccc}0& 0& 0\end{array}\end{array}& \begin{array}{c}\begin{array}{ccc}0& 0& 0\\ 0& 0& 0\\ 1& 0& 1\end{array}\\ \begin{array}{ccc}0& 1& 1\end{array}\end{array}& \begin{array}{c}\begin{array}{cc}\begin{array}{cc}0& 1\\ 1& 0\\ 0& 1\end{array}& \begin{array}{cc}0& 1\\ 1& 0\\ 0& 0\end{array}\end{array}\\ \begin{array}{cc}\begin{array}{cc}1& 0\end{array}& \begin{array}{cc}0& 0\end{array}\end{array}\end{array}\end{array}\right)$

Therefore, the Seidel matrix of the Petersen graph is $S\left(G\right)$.

$S\left(G\right)=\left(\begin{array}{cccccccccc}0& -1& -1& 1& 1& -1& 1& 1& 1& 1\\ -1& 0& 1& -1& 1& 1& -1& 1& 1& 1\\ -1& 1& 0& 1& -1& 1& 1& -1& 1& 1\\ 1& -1& 1& 0& -1& 1& 1& 1& -1& 1\\ 1& 1& -1& -1& 0& 1& 1& 1& 1& -1\\ -1& 1& 1& 1& 1& 0& 1& 1& -1& -1\\ 1& -1& 1& 1& 1& 1& 0& -1& 1& -1\\ 1& 1& -1& 1& 1& 1& -1& 0& -1& 1\\ 1& 1& 1& -1& 1& -1& 1& -1& 0& 1\\ 1& 1& 1& 1& -1& -1& -1& 1& 1& 0\end{array}\right)$

The Seidel eigenvalues polynomial corresponding to it is denoted as $S_G\left(\lambda \right)=s_0{\lambda }^n+s_1{\lambda }^{n-1}+\cdots +s_n{\lambda }^0$.

It can be obtained from Definition 2.1:

$S_0=t{r}^{\left[0\right]}\left(S\left(G\right)\right)=1$;

Since, $S_1={\left(-1\right)}^{1}t{r}^{\left[1\right]}\left(S\left(G\right)\right)$, $m\left(t{r}^{\left[1\right]}\left(S\left(G\right)\right)\right)=C_{10}^1=10$. Thus,

$S_1=a_{11}+a_{22}+a_{33}+a_{44}+a_{55}+\cdots +a_{1010}=0$;

Since, $S_2={\left(-1\right)}^{2}t{r}^{\left[2\right]}\left(S\left(G\right)\right)$, $m\left(t{r}^{\left[2\right]}\left(S\left(G\right)\right)\right)=C_{10}^2=45$. Thus,

$S_2=15\left|\begin{array}{cc}0& -1\\ -1& 0\end{array}\right|+30\left|\begin{array}{cc}0& 1\\ 1& 0\end{array}\right|=-45$;

Since, $S_3={\left(-1\right)}^{3}t{r}^{\left[3\right]}\left(S\left(G\right)\right)$, $m\left(t{r}^{\left[3\right]}\left(S\left(G\right)\right)\right)=C_{10}^3=120$. Thus,

$\begin{array}{c}{S}_3=-8\left|\begin{array}{ccc}0& -1& -1\\ -1& 0& 1\\ -1& 1& 0\end{array}\right|+14\left|\begin{array}{ccc}0& -1& 1\\ -1& 0& -1\\ 1& -1& 0\end{array}\right|+30\left|\begin{array}{ccc}0& 1& 1\\ 1& 0& 1\\ 1& 1& 0\end{array}\right|+23\left|\begin{array}{ccc}0& -1& 1\\ -1& 0& 1\\ 1& 1& 0\end{array}\right|\\ +23\left|\begin{array}{ccc}0& 1& 1\\ 1& 0& -1\\ 1& -1& 0\end{array}\right|+14\left|\begin{array}{ccc}0& 1& -1\\ 1& 0& 1\\ -1& 1& 0\end{array}\right|+8\left|\begin{array}{ccc}0& 1& -1\\ 1& 0& -1\\ -1& -1& 0\end{array}\right|\\ =0;\end{array}$

Similarly, we can obtain:

$S_4={\left(-1\right)}^{4}t{r}^{\left[4\right]}\left(S\left(G\right)\right)$, $m\left(t{r}^{\left[4\right]}\left(S\left(G\right)\right)\right)=C_{10}^4=210$, that is, $S_4=818$;

$S_5={\left(-1\right)}^{5}t{r}^{\left[5\right]}\left(S\left(G\right)\right)$, $m\left(t{r}^{\left[5\right]}\left(S\left(G\right)\right)\right)=C_{10}^5=252$, that is, $S_5=0$;

$S_6={\left(-1\right)}^{6}t{r}^{\left[6\right]}\left(S\left(G\right)\right)$, $m\left(t{r}^{\left[6\right]}\left(S\left(G\right)\right)\right)=C_{10}^6=210$, that is, $S_6=-7218$;

$S_7={\left(-1\right)}^{7}t{r}^{\left[7\right]}\left(S\left(G\right)\right)$, $m\left(t{r}^{\left[7\right]}\left(S\left(G\right)\right)\right)=C_{10}^7=120$, that is, $S_7=324$;

$S_8={\left(-1\right)}^{8}t{r}^{\left[8\right]}(S\left(G\right)$, $m\left(t{r}^{\left[8\right]}\left(S\left(G\right)\right)\right)=C_{10}^8=45$, that is, $S_8=32805$;

$S_9={\left(-1\right)}^{9}t{r}^{\left[9\right]}\left(S\left(G\right)\right)$, $m\left(t{r}^{\left[9\right]}\left(S\left(G\right)\right)\right)=C_{10}^9=10$, that is, $S_9=5.1\times {10}^{-12}$;

$S_{10}={\left(-1\right)}^{10}t{r}^{\left[10\right]}\left(S\left(G\right)\right)$, $m\left(t{r}^{\left[10\right]}\left(S\left(G\right)\right)\right)=C_{10}^{10}=1$, that is,

$S_{10}=\left(\begin{array}{ccc}\begin{array}{ccc}0& 1& 1\\ 1& 0& 1\\ 1& 1& 0\end{array}& \begin{array}{ccc}1& 1& 1\\ 1& 1& 1\\ 1& 1& 1\end{array}& \begin{array}{cc}\begin{array}{cc}1& 1\\ 1& 1\\ 1& 1\end{array}& \begin{array}{cc}1& 1\\ 1& 1\\ 1& 1\end{array}\end{array}\\ \begin{array}{ccc}1& 1& 1\\ 1& 1& 1\\ 1& 1& 1\end{array}& \begin{array}{ccc}0& 1& 1\\ 1& 0& 1\\ 1& 1& 1\end{array}& \begin{array}{cc}\begin{array}{cc}1& 1\\ 1& 1\\ 1& 1\end{array}& \begin{array}{cc}1& 1\\ 1& 1\\ 1& 1\end{array}\end{array}\\ \begin{array}{c}\begin{array}{ccc}1& 1& 1\\ 1& 1& 1\\ 1& 1& 1\end{array}\\ \begin{array}{ccc}1& 1& 1\end{array}\end{array}& \begin{array}{c}\begin{array}{ccc}1& 1& 1\\ 1& 1& 1\\ 1& 1& 1\end{array}\\ \begin{array}{ccc}1& 1& 1\end{array}\end{array}& \begin{array}{c}\begin{array}{cc}\begin{array}{cc}0& 1\\ 1& 0\\ 1& 1\end{array}& \begin{array}{cc}1& 1\\ 1& 1\\ 0& 1\end{array}\end{array}\\ \begin{array}{cc}\begin{array}{cc}1& 1\end{array}& \begin{array}{cc}1& 1\end{array}\end{array}\end{array}\end{array}\right)=59049$

Therefore, the Seidel eigenvalues polynomial of the Petersen graph G is

$S_G\left(\lambda \right)={\lambda }^{10}-45{\lambda }^8+818{\lambda }^6-7218{\lambda }^4+324{\lambda }^3+32805{\lambda }^2+5.1\times {10}^{-12}\lambda -59049$.

That is, Theorem 1.4 is proved.

In what follows, we verify Theorem 1.5.

Proof of Theorem 1.5. Let G be the Petersen graph ( Figure 1 ),

$\begin{array}{c}{S}_G\left(\lambda \right)={\lambda }^{10}-45{\lambda }^8+818{\lambda }^6-7218{\lambda }^4+324{\lambda }^3+32805{\lambda }^2+5.1\times {10}^{-12}-59049\\ ={\left(\lambda +3\right)}^5{\left(\lambda -3\right)}^5\end{array}$

Let $S_G\left(\lambda \right)=0$, then we get: ${\lambda }_1={\lambda }_2={\lambda }_3={\lambda }_4={\lambda }_5=-3$, ${\lambda }_6={\lambda }_7={\lambda }_8={\lambda }_9={\lambda }_{10}=3$.

Obviously, the Seidel eigenvalues of the Petersen graph are integers. That is to say, the Petersen graph is a Seidel integral graph.

This paper primarily investigates whether the Petersen graph is a Seidel integral graph. It concludes that the Petersen graph is indeed a Seidel integral graph and provides the Seidel eigenvalues polynomial for the Petersen graph.

It is also noted that when each vertex of the Petersen graph is replaced with a cycle, the structure of the graph becomes complex and the Seidel matrix grows extremely large. This complexity makes it challenging to obtain its eigenvalues polynomial. Consequently, the Seidel eigenvalues polynomial of the Petersen graph in a more general case, as well as results related to Seidel integral graphs, have not been derived in this paper.

After that, we hope to use algorithms to solve the problem of Seidel eigenvalues of the Petersen graph class, and obtain the Seidel energy of this class of graphs. Additionally, we will explore the role that the graph energy plays in the quantitative structure, properties and activities.

This work was supported by Project 07M2024011 of the 2024 School Level at Qinghai Minzu University.