1. Introduction
Let be a connected graph. The (adjacency) spectrum of is the multiset of eigenvalues of the adjacency matrix of , denoted by . Two graphs are called isospectral if they share the same adjacency spectrum. It is obvious that two graphs are isospectral whenever they are isomorphic. Naturally, the problem of whether the converse setting holds comes to mind. A graph is said to be determined by its spectrum (or DS for short) if, for any graph , whenever . In 1956, the following problem originated from chemistry was proposed:
Problem 1 ([
1])
. Which graphs are DS? Initially, it was widely accepted that every graph is DS until 1957, when Collatz et al. [
2] constructed a pair of isospectral yet non-isomorphic trees. Schwenk [
3] later established a stronger result: almost all trees are isospectral and, consequently, fail to be DS. Brooks et al. [
4] generalized the Seidel switching, which is an operation on graphs preserving spectral properties under specific regularity conditions, to produce a family of isospectral 6-regular graphs. Meanwhile, loops and multiple edges are allowed in such graphs, which inherently prevents the definition of their complement. A nice advantage of Seidel switching lies in its application to simple graphs, which maintain isospectral complements of the original and of the resulting graph. Seress [
5] demonstrated this property by constructing a family of isospectral 8-regular simple graphs on
n vertices with isospectral complements. In subsequent years, the DS problem has attracted significant attention; one may refer to [
6,
7,
8,
9,
10,
11,
12,
13,
14] for more details.
A particularly interesting class of graphs is known as Cayley graphs, a distinguished class of highly symmetric graphs. In algebraic graph theory, Cayley graphs over finite groups represent one of the most prosperous topics. Thus, they attract sustained and widespread interest of scholars. Let
G be a finite group with identity element
e. For an inverse-closed subset
, the Cayley graph of
G with respect to
S, denoted by
, is defined as the graph with the vertex set
G, such that
x,
y are adjacent if and only if
. It is well known that the Cayley graph
is connected if and only if
S generates
G. Throughout this paper, we consider only connected Cayley graphs. This paper contributes towards the DS problem for Cayley graphs. For a certain group
G, the Cayley graph
is called Cay-DS if, for any other Cayley graph
,
implies
. The group
G is Cay-DS if all Cayley graphs of
G are Cay-DS. A DS Cayley graph is always Cay-DS, but the converse fails in general as suggested in [
6]. Naturally, the following problems are considered.
Problem 2 (Cay-DS problem [
6])
. Which Cayley graphs are Cay-DS? Which finite groups are Cay-DS?
Elspas and Turner [
15] pioneered and constructed several pairs of isospectral but non-isomorphic circulant graphs. Babai [
7] later generalized this by proving that, for any integer
and prime
, the dihedral group
admits
k pairwise isospectral but non-isomorphic Cayley graphs. Abdollahi et al. [
6,
16] made much significant contribution to this problem, including providing infinite families of non-Cay-DS solvable groups and exhibiting
(
is prime) pairs of isospectral but non-isomorphic Cayley graphs of
. Huang et al. [
17] demonstrated that a circulant graph whose order is either a prime power or the product of two distinct primes is Cay-DS if its generating set satisfies certain conditions. Lubotzky et al. [
18] employed Bruhat–Tits building theory to present some isospectral but non-isomorphic Cayley graphs over
. The Cay-DS problems of dicyclic groups
and dihedral groups
were investigated by Tang et al. [
19] and Yang et al. [
20], respectively. Despite these advances, a complete resolution to the Cay-DS problem remains open.
Let
be a metacyclic group of order
, which is non-abelian. In particular,
is a dihedral group if
;
is a dicyclic group if
. As we mentioned above, isospectral but non-isomorphic Cayley graphs of a dihedral group and a dicyclic group were investigated. Moreover, various spectra of a commuting graph, non-commuting graph, and commuting conjugacy class graph of the metacyclic groups
were already obtained [
21,
22,
23]. Our purpose here is for the case
and the adjacency spectra of the Cayley graphs of metacyclic groups
. The aim of the present paper is to contribute to parts of the Cay-DS problem of metacyclic groups
of order
, where
p is an odd prime, in terms of irreducible characters. After presenting some preliminary results, it first derives the irreducible characters of
. Then as an application, it establishes a system of equations concerning the spectrum of Cayley graphs of
. Next, building upon the experience of [
6,
19], it constructs an extensive family of pairwise non-isomorphic yet isospectral Cayley graphs pairs of
with
. As a conclusion, this result shows that
is Cay-DS if and only if
, which offers new insights into the Cay-DS problem.
2. Preliminary Results
In this section, notations and technical results that will be used later are presented. For a detailed description of group representation theory, we refer to [
24,
25].
Lemma 1 ([
24])
. The number of distinct irreducible characters of a finite group G coincides with the number of conjugacy classes of G. Definition 1. Let G be a finite group and let be the field of complex numbers. Let ψ, φ be two functions from G to . Then the inner product of ψ, φ is defined by
Lemma 2 ([
24])
. Let G be a finite group and χ be a character of G. Then χ is irreducible if and only if . Definition 2. Let G be a group. For arbitrary two elements , the commutator of a and b is defined by . The derived subgroup (or commutator subgroup) of G, denoted by , is the subgroup generated by all commutators, i.e., .
Lemma 3 ([
24])
. The linear characters of a finite group G are exactly the lifts to G of the irreducible characters of the group . Lemma 4 ([
24])
. The irreducible characters of the cyclic group are with , where , and . Lemma 5 ([
24])
. Let G be a finite group and let ρ be a representation of G of degree two. Then ρ is irreducible if there exist two elements , such that . The next somewhat technical lemma is crucial for our study, which derives an expression for the spectrum of Cayley graphs in terms of irreducible characters of the finite group G.
Lemma 6 ([
7])
. Let G be a finite group of order n with identity element e. Let be all irreducible characters of G with the degree . Then for any inverse-closed subset S of , the spectrum of the Cayley graph can be arranged asFurthermore, for any and any positive integer m, Using Equation (
1) for
, one obtains a system of equations, whose roots are
. Now we apply the results to the metacyclic group
, and we next always assume that
Hypothesis 1. is a metacyclic group of order . Moreover, .
It is straightforward to verify that
Lemma 7. For all , the following hold:
if ; if .
if ; if .
if ; if .
Lemma 8. Let , , where .
If n is odd, then the conjugacy classes of are listed as follows: The character table of is shown in Table 1, where and are irreducible characters with respect to degree one and two, ; ; . If n is even, then the conjugacy classes of are listed as follows: The character table of is shown in Table 2, where and are irreducible characters with respect to degree one and two, ; ; ; . Proof. For arbitrary two elements
,
, it follows that
Therefore, if
n is odd, there are
conjugacy classes, as follows:
If
n is even, there are
conjugacy classes, as follows:
Since , then the derived subgroup . Therefore, if n is odd, then and Let , where . Then Lemma 3 yields that the 8 linear characters of are , where . Since , then Lemma 2 shows that is irreducible.
If n is even, then , Hence, the 16 linear characters of are , where and . Since , then Lemma 2 shows that is irreducible.
Define a map
(
,
) from
to
by
where
. Then
is a representation of
since the following relations hold:
where
is the identity matrix of order two. Moreover,
since
. Hence, Lemma 5 yields that
is irreducible.
Let
be the character of
. Then
which means that there are
irreducible characters with degree 2 if
n is odd, and
irreducible characters with degree 2 if
n is even.
Since
has
conjugacy classes if
n is odd,
conjugacy classes if
n is even, and we have produced
irreducible characters if
n is odd,
irreducible characters if
n is even, then Lemma 1 yields that we have now found out the complete character table of
, as shown in
Table 1 if
n is odd, and shown in
Table 2 if
n is even. □
Next, we always assume that
Hypothesis 2. The set of all spectrum of is denoted byif n is odd,if n is even. Let , .
It is straightforward to verify that
Lemma 9. For , one obtains that Let G be a group and let be a character of G. For two subsets of G, denote , , .
For an inverse-closed subset
S of
, let
Then Lemma 7 yields that , .
In view of Lemmas 6–8, the spectrum of the Cayley graph
can be given by
which means that
and
Hypothesis 3. Let . For arbitrary and a non-empty integer set A, let denote the number of solutions to the congruence equation Lemma 10. Let n be odd. Let S and T be two inverse-closed subsets of , and let , , , , , . Then the Cayley graphs and are isospectral if , or and holds for each .
Proof. From Equations (
4), (
6), and (
8),
and
if
,
or
. Moreover, Equation (
9) yields that
if
, where
and
. Hence,
if
holds for each
. Therefore,
if
,
or
and
holds for each
. □
Lemma 11 ([
26])
. Let p be an odd prime. Then if and only if there exists an element , such that . Lemma 12. For an odd prime p, the automorphism group of iswhere Proof. It is well known that a bijection
from
to
is a homomorphism if and only if
,
, and
. Note that
,
,
,
,
,
for all
and
. Meanwhile,
for all
and
. Hence,
which means that
.
Define a map
from
to
by Equation (
10). It is straightforward to verify that
is a bijection. Since
and
, it follows that
which means that
is a homomorphism. Then
. Therefore,
which means that
. Hence,
. □
Fact 1. Let , be two simple (without loops and multiple edges) connected graphs, and let , be their complements, respectively. Then and are isospectral but non-isomorphic if and only if and are isospectral but non-isomorphic.
3. Isospectral Cayley Graphs of with
In this section, we will always assume that
Hypothesis 4. be a prime number;
, ;
, ;
, ;
, ;
is a partition of the set determined by the equivalence relation ∼: for , if and only if or , i.e., Lemma 13. For arbitrary , and .
Proof. Suppose on the contrary that there exists
, such that
, which means that there exist some suitable integers
,
and
, such that
Let Let . Then . It is straightforward to verify that the set of all triples satisfying is , , , and . Therefore, precisely one of y or z must be 0. Meanwhile, the set of all triples satisfying is , , , and , which contradicts . Therefore, holds for arbitrary .
Similarly, if there exists
, such that
, then there exist some suitable integers
,
, and
, such that
Let . Let . Then . After some elementary calculation, one obtains that all four possible solutions to the equation in are , , and , while there are six possible solutions in : , , , , , and , which contradicts . Therefore, holds for arbitrary . □
Combining this result with Lemma 11, one obtains that
Corollary 1. , .
Lemma 14. For arbitrary , (or , or , or ) if and only if or 7, and .
Proof. If or 7, and , then, obviously, , , and .
For arbitrary
, if
then
or 7. Additionally, let
,
. Let
. Then
. It follows that all possible solutions
to the equation
in
are
,
,
, and
, which means that exactly one of
x,
y,
z must be
. Meanwhile, all possible solutions
to the equation
in
are
,
,
, and
, and exactly one of
x,
y,
z must be 1. Since
, then
and
, which means that
. Therefore,
. Hence,
and
.
Similarly, if and , or , or , then or 7, and . □
Lemma 15. The Cayley graphs and are connected 12-regular, isospectral, but non-isomorphic.
Proof. Equations (
4), (
6), (
8), and (
9) yield that
where
Therefore, the Cayley graphs
and
are isospectral since
holds for each
. Corollary 1 yields that
. Therefore, the results hold. □
Lemma 16. The Cayley graphs and are connected 14-regular, isospectral, but non-isomorphic.
Proof. Equations (
4), (
6), (
8), (
9) yield that
where
Therefore, the Cayley graphs
and
are isospectral since
holds for each
. Corollary 1 yields that
. Therefore, the results hold. □
Corollary 2. Let U be a -subset of , which consists of the union of arbitrary k members of . Then
and are connected -regular, isospectral, but non-isomorphic;
and are connected -regular, isospectral, but non-isomorphic;
and are connected -regular, isospectral, but non-isomorphic;
and are connected -regular, isospectral, but non-isomorphic.
Proof. (1) If , then there exists such that . Since preserves the order of elements of , then , , which is impossible by Lemma 13. Hence, follows from Lemma 11. Meanwhile, Lemma 10 and the proof of Lemma 15 yield that the Cayley graphs and are isospectral.
Proceeding as in above, (2), (3), and (4) hold. □
Theorem 1. Let d be an integer such that and . Then, for each d, there exist pairs d-regular (-regular) Cayley graphs of that are pairwise isospectral but non-isomorphic.
Proof. Case 1: . Then . Let U be a -subset of , which consists of the union of all members of . Then Lemma 15 and Corollary 2 yield that the Cayley graphs and are connected 12-regular, isospectral, but non-isomorphic; and are connected 13-regular, isospectral, but non-isomorphic; and are connected -regular, isospectral, but non-isomorphic; and and are connected -regular, isospectral, but non-isomorphic.
Case 2:
. If
d is even (odd, respectively), then assume that
U,
V are two distinct
-subsets (
-subsets, respectively) of
, which consist of the union of
(
, respectively) members of
. Let
It is straightforward to verify that the Cayley graphs , , , and are connected and d-regular.
Lemma 11 yields that if , then there exists a automorphism such that (, respectively), and then and . Hence, Lemma 13 shows that . Similarly, .
Lemma 11 yields that if , then there exists a automorphism such that (, respectively), and then and . By Lemma 14, if and only if or . However, since for , which means that . Similarly, .
Moreover, Corollary 2 shows that , . Hence, d-regular Cayley graphs in the set are pairwise non-isomorphic.
Assume that
,
are two distinct
-subsets (
-subsets, respectively) of
, which consist of the union of
(
, respectively) members of
. Let
Proceeding as in above, d-regular Cayley graphs in the set are pairwise non-isomorphic. At last, it is routine to verify that, for arbitrary graphs , , one obtains that . Therefore, d-regular Cayley graphs in the set are pairwise non-isomorphic.
Corollary 2 yields that and are isospectral; and are isospectral; and are isospectral; and and are isospectral.
Since there are
distinct
-subset of
,
distinct
-subset of
, then one can construct
pairs
d-regular Cayley graphs of
that are pairwise isospectral but non-isomorphic.
Finally, one obtains the desired results by Fact 1. □