A note on eigenvalues of Cayley graphs (Q6966775)

\qquad Let \(G\) be a group with identity \(e\) and let \(\mathcal{C}\) be a subset of \(G \setminus \{ e \}\) such that either \(\mathcal{C}^{-1} = \mathcal{C}\) or \(\mathcal{C}^{-1} \cap \mathcal{C} = \emptyset\). Define a graph with vertex set \(G\) and arc set \(\{(g, h): h g^{-1} \in \mathcal{C}\}\). If \(\mathcal{C}^{-1} = \mathcal{C}\), this is an undirected graph and if \(\mathcal{C}^{-1} \cap \mathcal{C} = \emptyset\), it is a digraph. This is the Cayley graph (or Cayley digraph) for \(G\) with respect to \(\mathcal{C}\) and is denoted by Cay\((G, \mathcal{C})\). The set \(\mathcal{C}\) is the connection set of this graph. The Cayley graph is called normal if \(\mathcal{C}\) is a union of conjugacy classes of \(G\).\N\N\qquad A graph is said to be integral if all its eigenvalues are integers. In this paper, the authors show that a non-empty integral normal Cayley graph for a group of odd order has an odd eigenvalue. To be more precise, let \(G\) be a group of odd order and let \(X\) be a non-empty integral, normal Cayley graph for \(G\), then \(X\) has an odd eigenvalue.