Next Article in Journal
On Two Open Problems on Double Vertex-Edge Domination in Graphs
Previous Article in Journal
A New Perspective on Parametric Metric Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Directed Strongly Regular Cayley Graphs over Metacyclic Groups of Order 4n

1
School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, China
2
School of Mathematics and Statistics, Central South University New Campus, Changsha 410083, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2019, 7(11), 1011; https://doi.org/10.3390/math7111011
Submission received: 15 September 2019 / Revised: 16 October 2019 / Accepted: 22 October 2019 / Published: 24 October 2019
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
We construct several new families of directed strongly regular Cayley graphs (DSRCGs) over the metacyclic group M 4 n = a , b | a n = b 4 = 1 , b 1 a b = a 1 , some of which generalize those earlier constructions. For a prime p and a positive integer α > 1 , for some cases, we characterize the DSRCGs over M 4 p α .

1. Introduction

The directed strongly regular graph [1] is one generalization of the undirected strongly regular graphs (SRG), which is an interesting topic in algebraic graph theory.
A directed strongly regular graph (DSRG) with parameters ( n , k , μ , λ , t ) is a k-regular directed graph on n vertices such that every vertex is on t 2-cycles (which may be considered as undirected edges), and the number of paths of length two from a vertex u to a vertex v is λ if there is an arc from u to v, and it is μ if there is no arc from u to v. There is also another definition of a DSRG regarding the adjacency matrix. For a directed graph X of order n, its adjacency matrix is A = A ( X ) = ( a i j ) n × n , where a i j = 1 if v i and v j are adjacent, and a i j = 0 otherwise. We use I = I n to denote the n × n identity matrix; J = J n the all-ones matrix. Then X is a DSRG with parameters ( n , k , μ , λ , t ) if and only if J A = A J = k J and A 2 = t I + λ A + μ ( J I A ) . When t = k , the DSRG is just the undirected SRG. When t = 0 , the DSRG is the doubly regular tournaments [1]. Therefore we assumed that 0 < t < k in the rest of the paper.
For the SRGs and DSRGs, they share many analog properties. In particular, their eigenvalues are extremely similar. However, for a DSRG, its adjacency matrix is non-symmetric, this leads to more difficulties and makes it an interesting subject. Observe that the DSRGs have several parameters, there has been many constructions oriented to obtain several infinite families of DSRGs, also, some sporadic examples are known in the literature. Although many scholars have studied the existence and constructions of DSRGs for different parameters (one may refer to [2,3,4,5]), there are also plenty of DSRGs whose existence cannot be determined. As such, the complete characterization of DSRGs is far from being solved.
By using character theory of finite groups, He and Zhang [6] generalized the semidirect product method in [2] and obtained a large family of directed strongly regular Cayley graph (DSRCG). Technically, they constructed some DSRCGs over dihedral groups, which partially generalize the earlier results in [5]. These results reveals that representation theory is a powerful tool in this subject. For more results regarding the interplay between algebraic graph theory and representation theory, one may refer to [7,8,9] and the references therein.
The purpose of this paper is to construct several new infinite families of DSRGs by making use of the representation theory. Borrowing ideas from [6], we consider the DSRCGs over the metacyclic group M 4 n = a , b | a n = b 4 = 1 , b 1 a b = a 1 of order 4 n [10]. Let C n = a be a cyclic multiplicative group of order n. The metacyclic group M 4 n can be viewed as the semidirect product of C n = a of order n and C 4 = b of order 4. As mentioned in [7], if n is odd, the metacyclic group M 4 n is the dicyclic group T 4 n . Therefore it would be interesting to consider this group for various applications.
This paper is organized as follows. At first, we give some sufficient and necessary conditions for the Cayley graph C ( T 4 n , X Y b X b 2 Y b 3 ) with X = Y and X Y to be directed strongly regular, and we construct several new classes of DSRCGs over metacyclic groups. Then, for prime p, we characterize the DSRCGs C ( T 4 p α , a X a Y b a X b 2 a Y b 3 ) when X = Y or X Y .

2. Preliminaries

In this section, we present the fundamental concepts, we also present several lemmas which will be used later. In the sequel, F = Q [ ω ] is the n-th cyclotomic field over the rationals, where ω is the primitive n-th root of unity.
For a multiset M, we define the multiplicity function Δ M : M N , where Δ M ( x ) is the number of times the element x appears in M. For two multisets M and N, the sum of M and N is denoted by M N , then Δ M N = Δ M + Δ N . For a positive integer n, the scalar multiplication of M by n is defined as n M , then we have Δ n M = n Δ M . The difference of M and N is defined as M N , then we have Δ M N ( x ) = max { Δ M ( x ) Δ N ( x ) , 0 } for any x M . For instance, if M = { 2 , 3 , 3 , 4 , 4 } and N = { 1 , 1 , 2 , 2 , 3 } , then we have M N = { 1 , 1 , 2 , 2 , 2 , 3 , 3 , 4 , 4 } , 2 M = { 2 , 2 , 3 , 3 , 3 , 3 , 4 , 4 , 4 , 4 } , and M N = { 3 , 4 , 4 } .
For a finite group G with the identity element e (we sometimes use 1 if there is no confusion), and a non-empty subset S of G, we denote by S ( 1 ) the set { s 1 s S } . Assume now that e S , then the graph Γ = C ( G , S ) is called the directed Cayley graph over G with respect to S , if V ( Γ ) = G and x y (means there is an arc from x to y) if and only if y x 1 S for any x , y G .
Let G be a group and C be the complex field. We denote the group algebra of G over C by C G , and we denote the element of C G by X ¯ for any multisubset X of G. Thus we can write X ¯ as
X ¯ = x X Δ X ( x ) x .
By using the group algebra, we have
Lemma 1
([1]). A Cayley graph C ( G , S ) of group G with the multiset S G is a DSRG with parameters ( n , k , μ , λ , t ) if and only if | G | = n , | S | = k and
S ¯ 2 = t e + λ S ¯ + μ ( G ¯ e S ¯ ) .
The following relations will be frequently used in the context.
Lemma 2.
For the metacyclic group M 4 n = a , b | a n = b 4 = 1 , b 1 a b = a 1 , we have
(i) 
a k b = b a k ; a k b 2 = b 2 a k ; a k b 3 = b 3 a k ;
(ii) 
( a k b ) 1 = a k b 3 ; ( a k b 2 ) 1 = a k b 2 .
Proof. 
By relations a n = b 4 = 1 and b 1 a b = a 1 , the results follow immediately. □

2.1. Fourier Transformation on Z n

The following statement and notations are coincided with [6,11]. Let M , N be the multisubsets of Z n and k Z n . We denote k M = { k m m M } , k + M = { k + m m M } , and k M = { k m m M } . The sum of multisubsets M and N is M + N = { m + n m M , n N } , and the multiplicity function of M + N is
Δ M + N ( c ) = m + n = c Δ M m Δ N n ,
for any c Z n . And let
x M = m M Δ M ( m ) x m .
Then C n = x Z n and x M is a multisubset of C n .
Let Z n be the multiplicative group of the units in the ring Z n . Then Z n has an action on Z n by multiplication, and hence Z n is the union of some Z n -orbits. Each Z n -orbit consists of all elements of a given order in the additive group Z n . We denote the Z n -orbit containing all elements of order r by O r , where r is a positive divisor of n. Thus
O r = z z Z n , n ( n , z ) = r = c n r 1 c r , c Z n ,
and O r = φ ( r ) .
We denote all functions f : Z n F mapping from Z n to the field F by F Z n . By defining the multiplication point-wise, the F -algebra obtained from F Z n will be denoted by F Z n , · . And the F -algebra obtained from F Z n by defining the multiplication as the convolution will be denoted by F Z n , , where the convolution is defined by:
( f g ) ( z ) = i Z n f ( i ) g ( z i ) , f , g F Z n .
The Fourier transformation, as an isomorphsim between the F -algebra F Z n , · and F Z n , , is defined as
F : F Z n , F Z n , · , ( F f ) ( z ) = i Z n f ( i ) ω i z .
For any multisubsets M and N of Z n , we have
F Δ ( M ) = F Δ M ¯ , F Δ M + N = F Δ M Δ N = F Δ M F Δ N .
Then, for r Z n = { 0 , r , 2 r , , n r } , where r is a positive divisor of n, we have
F Δ r Z n = n r Δ n r Z n , F Δ Z n = n Δ 0 , F Δ 0 = Δ Z n = 1 .
The following lemmas will be used in the sequel.
Lemma 3
([11]). Let f : Z n F be a function and Im ( f ) Q . Then we have Im ( F f ) Q if and only if f = r | n α r Δ O r for some α r Q .
From the Ramanujan’s sums, we have
F Δ O r ( z ) = μ r ( r , z ) φ ( r ) φ r ( r , z ) Z .
Let v be a positive divisor of n. Then we can define a homomorphism
ψ v : Z n Z v , i i ( mod v ) + v Z n
with K e r ψ v = v Z n . Then it follows that
Lemma 4
([6]). If F ( z ) is a complex variables function, then we have
F F Δ ψ v ( H ) ( v ) ( z ) = 0 , z Z v F F Δ H ( z ) = 0 , z n v Z n .

2.2. Some Lemmas

Throughout this section, we always assume that p is a prime and α 1 is an integer.
Let ν p ( z ) be the maximum power of the prime p that divides z. Note that the set of divisors of p α is 1 , p , p 2 , , p α 1 , p α , so all the Z p α -orbits are O 1 = O p 0 , O p , O p 2 , , O p α , where
O p z = c p α z 1 c p z , ( p , c ) = 1 = i i Z p α , ν p ( i ) = α z .
We denote O p i by O i for simplicity hereafter. In particular, O 1 = i i Z p α , ν p ( i ) = α = { 0 } .
Note that p α β Z p α is a subgroup of Z p α and
p α β Z p α = i = 0 β O p i = i = 0 β O i ,
for each 0 β α .
In this section, we assume that X is a subset of Z p α such that 0 X and
F Δ X ( X ) ( z ) = F Δ X ( z ) + F Δ X ( z ) ¯ { 0 , m } ,
for any 0 z Z p α , where m is a positive integer. We also assume X X . Then we have
Lemma 5
([6]). Let X be a subset of Z p α such that
F Δ X ( X ) ( z ) = F Δ X ( z ) + F Δ X ( z ) ¯ { 0 , m } ,
where m is a positive integer. Then there exists some integers 1 r 1 < r 2 < < r s α and 1 r s + 1 < r s + 2 < < r t α satisfy
X ( X ) = 2 O r 1 2 O r 2 2 O r s O r s + 1 O r s + 2 O r t .
Let I 1 = r 1 , r 2 , , r s and I 2 = r s + 1 , r s + 2 , , r t . Then I 2 as X X . Thus I 1 = s and I 2 = t s 1 .
Lemma 6
([6]). Let I 1 and I 2 be the sets defined above. Then I 1 and I 2 form a partition of { β + 1 , β + 2 , , α } for some integer 0 β α 1 . Hence
X ( X ) = O r 1 O r 2 O r s Z p α p α β Z p α .
Lemma 7
([6]). Let X be a subset of Z p α { 0 } satisfying the condition (5), and I 1 , I 2 be the sets defined above. If p is an odd prime, then I 1 = and
X ( X ) = Z p α p α β Z p α .
Lemma 8
([6]). Let X be a subset of Z 2 α { 0 } satisfies the condition (5), and I 1 , I 2 be the sets defined above. If I 1 , then I 1 = { β + 1 } , I 2 = { β + 1 , β + 2 , , α } and
X ( X ) = O β + 1 ( Z 2 α 2 α β Z p α ) .
Lemma 9
([6]). Let X be a subset of Z p α and 0 < γ α be a positive integer. If X satisfies F Δ X ( z ) = 0 for all z p γ Z p α , then X = T + p α γ Z p α for some subset T of 0 , 1 , , p α γ 1 .

3. The DSRCGs over M 4 n

In this section, we will provide several constructions of DSRCGs over M 4 n .
Let Λ 1 = a X ¯ + a ( X ) ¯ = a X ( X ) ¯ and Λ 2 = a Y ¯ a ( Y ) ¯ a X ¯ a ( X ) ¯ .
We now give a criterion for the Cayley graph C ( M 4 n , a X a Y b a X b 2 a Y b 3 ) to be directed strongly regular.
Lemma 10.
The Cayley graph C ( M 4 n , a X a Y b a X b 2 a Y b 3 ) is a DSRCG with parameters ( 4 n , 2 ( | X | + | Y | ) , μ , λ , t ) if and only if
(i) 
t = μ ;
(ii) 
2 a Y ¯ Λ 1 = ( λ μ ) a Y ¯ + μ C n ¯ ;
(iii) 
2 ( a X ¯ Λ 1 + Λ 2 ) = a X ¯ 2 + a Y ¯ a ( Y ) ¯ = ( λ μ ) a X ¯ + μ C n ¯ .
Proof. 
By Lemma 2, we have
a X ¯ + a Y b ¯ + a X b 2 ¯ + a Y b 3 ¯ 2 = a X ¯ 2 + a X ¯ a Y ¯ b + a X ¯ 2 b 2 + a X ¯ a Y ¯ b 3 + a Y ¯ a ( X ) ¯ b + a Y ¯ a ( Y ) ¯ b 2 + a Y ¯ a ( X ) ¯ b 3 + a Y ¯ a ( Y ) ¯ + a X ¯ 2 b 2 + a X ¯ a Y ¯ b 3 + a X ¯ 2 + a X ¯ a Y ¯ b + a Y ¯ a ( X ) ¯ b 3 + a Y ¯ a ( Y ) ¯ + a Y ¯ a ( X ) ¯ b + a Y ¯ a ( Y ) ¯ b 2 = 2 a X ¯ 2 + a Y ¯ a ( Y ) ¯ + 2 a X ¯ a Y ¯ + a Y ¯ a ( X ) ¯ b + 2 a X ¯ 2 + a Y ¯ a ( Y ) ¯ b 2 + 2 a X ¯ a Y ¯ + a Y ¯ a ( X ) ¯ b 3 = 2 ( a X ¯ Λ 1 + Λ 2 ) + 2 a Y ¯ Λ 1 b + 2 ( a X ¯ Λ 1 + Λ 2 ) b 2 + 2 a Y ¯ Λ 1 b 3 .
Thus, from Lemma 1, the Cayley graph C ( M 4 n , a X a Y b a X b 2 a Y b 3 ) is a DSRCG with parameters ( 4 n , 2 ( | X | + | Y | ) , μ , λ , t ) if and only if
a X ¯ + a Y b ¯ + a X b 2 ¯ + a Y b 3 ¯ 2 = t e + λ a X ¯ + a Y b ¯ + a X b 2 ¯ + a Y b 3 ¯ + μ C n ¯ + C n b ¯ + C n b 2 ¯ + C n b 3 ¯ μ e μ a X ¯ + a Y b ¯ + a X b 2 ¯ + a Y b 3 ¯ = ( t μ ) e + ( λ μ ) a X ¯ + μ C n ¯ + ( λ μ ) a Y ¯ + μ C n ¯ b + ( λ μ ) a X ¯ + μ C n ¯ b 2 + ( λ μ ) a Y ¯ + μ C n ¯ b 3 .
Comparing the above two equations, we complete the proof. □
Setting X = Y in Lemma 10, we have
Lemma 11.
The Cayley graph C ( M 4 n , a X a X b a X b 2 a X b 3 ) is a DSRCG with parameters ( 4 n , 4 | X | , μ , λ , t ) if and only if t = μ and
2 a X ¯ Λ 1 = ( λ μ ) a X ¯ + μ C n ¯ .
We now define
r ( z ) = F Δ X ( z ) = i X ω i z and t ( z ) = F Δ Y ( z ) = i Y ω i z .
Then r ( z ) + r ¯ ( z ) = F Δ X ( X ) ( z ) . The following lemma gives a characterization of the Cayley graph C ( M 4 n , a X a Y b a X b 2 a Y b 3 ) to be directed strongly regular by using r ( z ) and t ( z ) .
Lemma 12.
The Cayley graph C ( M 4 n , a X a Y b a X b 2 a Y b 3 ) is a DSRCG with parameters ( 4 n , 2 ( | X | + | Y | ) , μ , λ , t ) if and only if
(i) 
t = μ ;
(ii) 
t ( r + r ¯ ) = μ n 2 Δ 0 + λ μ 2 t ;
(iii) 
r 2 + | t | 2 = μ n 2 Δ 0 + λ μ 2 r .
Proof. 
By Equation (1), we have
2 a Y ¯ Λ 1 = 2 a Y ¯ a X ( X ) ¯ = 2 j Z n Δ Y ( j ) x j · k Z n Δ X ( X ) ( k ) x k = 2 j , k Z n Δ Y ( j ) x j · Δ X ( X ) ( k ) x j + k = 2 j Z n Δ Y ( j ) x j · Δ X ( X ) ( i j ) x i = 2 ( Δ Y Δ X ( X ) ) ( i ) x i .
and
( λ μ ) a Y ¯ + μ C n ¯ = i Z n ( λ μ ) Δ Y ( i ) x i + i Z n μ Δ Z n ( i ) x i = i Z n ( ( λ μ ) Δ Y ( i ) + μ Δ Z n ( i ) ) x i .
From the two equations above and (ii) of Lemma 10, we have
Δ Y Δ X ( X ) ( i ) = λ μ 2 Δ Y ( i ) + μ 2 Δ Z n ( i ) ,
for i Z n . By Equation (2), we have
F Δ Y Δ X ( X ) ( i ) = F ( Δ Y ) F ( Δ X ( X ) ) ( i ) = t ( r + r ¯ ) ( i ) ,
and
F ( λ μ 2 Δ Y ) ( i ) + F ( μ 2 Δ Z n ) ( i ) = λ μ 2 F Δ Y ( i ) + μ 2 F Δ Z n ( i ) = ( λ μ 2 t + μ 2 n Δ 0 ) ( i ) .
Then by the two equations above, we have
t ( r + r ¯ ) = μ n 2 Δ 0 + λ μ 2 t .
Using the same method, by (iii) of Lemma 10, we have
Δ X Δ X 2 ( i ) + Δ Y Δ Y ( i ) = λ μ 2 Δ X ( i ) + μ 2 Δ Z n ( i ) ,
for i Z n . Moveover, by applying the Fourier transformation, we have
r 2 + | t | 2 = μ n 2 Δ 0 + λ μ 2 r .
 □
When X = Y , we have the following lemma.
Lemma 13.
The Cayley graph C ( M 4 n , a X a X b a X b 2 a X b 3 ) is a DSRCG with parameters ( 4 n , 4 | X | , μ , λ , t ) if and only if t = μ and
r ( r + r ¯ ) = μ n 2 Δ 0 + λ μ 2 r .
Let q = def r + r ¯ = F Δ X ( X ) . Then we have
Lemma 14.
The Cayley graph C ( M 4 p α , a X a X b a X b 2 a X b 3 ) is a DSRCG with parameters ( 4 p α , 4 | X | , μ , λ , t ) then
  • (1) The function q satisfies
    q ( z ) = ( r + r ¯ ) ( z ) = F Δ X ( X ) ( z ) { 0 , λ μ 2 } ,
    for any 0 z Z p α .
  • (2) There are some integers r 1 , r 2 , , r s with β + 1 r 1 < r 2 < < r s α satisfy
    X ( X ) = O r 1 O r 2 O r s Z p α p α β Z p α ,
    where 0 β α 1 .
  • (3) If p is an odd prime, then
    X ( X ) = Z p α p α β Z p α .
  • (4) If p = 2 and X ( X ) , then
    X ( X ) = O β + 1 ( Z 2 α 2 α β Z p α ) .
Proof. 
Taking conjugate on Equation (6), we have
r ¯ ( r + r ¯ ) = μ p α 2 Δ 0 + λ μ 2 r ¯ .
Then the sum of Equations (6) and (7) leads to
( r + r ¯ ) 2 = μ p α Δ 0 + λ μ 2 ( r + r ¯ ) .
Thus we have
( r + r ¯ ) ( z ) = 2 | X | , z = 0 ; 0 or λ μ 2 , z 0 .
By Lemmas 6, 7 and 8, we can prove Equations (2), (3) and (4) respectively. □
Next we will present several classes of DSRCGs when X = Y or X Y from the above results. In the remainder of this section, v is always assumed to be a positive divisor of n and l = n v .
Theorem 1.
Let T be a subset of { 1 , , v 1 } Z n , where v is an odd positive divisor of n, and X be a subset of Z n satisfy the following conditions:
(i) 
X = T + v Z n ;
(ii) 
X ( X ) = Z n v Z n .
Then the Cayley graph C ( T 4 n , a X a X b a X b 2 a X b 3 ) is a DSRCG with parameters ( 4 n , 2 ( n l ) , n l , n 3 l , n l ) .
Proof. 
From (ii), note that | X | = | X | = n l 2 . Thus, we have 2 a X ¯ Λ 1 = 2 a X ¯ a X ( X ) ¯ = 2 a X ¯ a Z n v Z n ¯ = 2 a X ¯ ( a Z n ¯ a v Z n ¯ ) = 2 a X ¯ ( C n ¯ a v Z n ¯ ) = 2 l a X ¯ + ( n l ) C n ¯ . Therefore, by Lemma 11, we get the desired result. □
Example 1.
For n = 6 , we have T 24 = { a , b a 6 = b 4 = 1 , b 1 a b = a 1 } . Let T = { 1 } and v = 3 . Then we have X = T + 3 Z 6 = { 1 , 4 } and X ( X ) = { 1 , 4 , 2 , 5 } = Z 6 3 Z 6 , where 3 Z 6 = { 0 , 3 } . Thus X satisfies the conditions ( i ) and ( i i ) of the Theorem 1. So we have the Cayley graph C ( T 24 , a X a X b a X b 2 a X b 3 ) is a DSRCG with parameters ( 24 , 8 , 4 , 0 , 4 ) , where X = { 1 , 4 } .
Theorem 2.
Let T be a subset of { 1 , , v 1 } Z n , where v > 2 is an even positive divisor of n. The subset X Z n satisfies the following conditions:
(i) 
X = T + v Z n ;
(ii) 
X ( X ) = Z n v Z n v 2 + v Z n ;
(iii) 
X v 2 + X = Z n .
Then the Cayley graph Γ = C ( M 4 n , a X a X b a X b 2 a X b 3 ) is a DSRCG with parameters ( 4 n , 2 n , n + 2 l , n 2 l , n + 2 l ) .
Proof. 
By (ii) and (iii), we have | X | = n 2 and Λ 1 = C n ¯ x v Z n ¯ + x v 2 + v Z n ¯ . Therefore, 2 a X ¯ Δ 1 = 2 l a X ¯ + n C n ¯ + 2 a X ¯ a v 2 + v Z n ¯ = 2 l a X ¯ + n C n ¯ + 2 l a v 2 + X ¯ = 2 l a X ¯ + n C n ¯ + 2 l C n ¯ 2 l a X ¯ = n + 2 l C n ¯ 4 l a X ¯ . The result follows from Lemma 11 directly. □
Example 2.
For n = 12 , we have T 48 = { a , b a 12 = b 4 = 1 , b 1 a b = a 1 } . Let T = { 1 , 2 } and v = 4 . Then we have X = T + 4 Z 12 = { 1 , 2 , 5 , 6 , 9 , 10 } . Thus X ( X ) = { 1 , 2 , 5 , 6 , 9 , 10 , 2 , 3 , 6 , 7 , 10 , 11 } = Z 12 4 Z 12 ( 2 + 3 Z 12 ) , where Z 12 4 Z 12 = { 1 , 2 , 3 , 5 , 6 , 7 , 9 , 10 , 11 } , 4 Z 12 = { 2 , 6 , 10 } , and X ( 2 + X ) = Z 12 . The set X satisfies the conditions ( i ) ( i i ) and ( i i i ) of Theorem 2. So we have the Cayley graph C ( T 48 , a X a X b a X b 2 a X b 3 ) is a DSRCG with parameters ( 48 , 24 , 18 , 6 , 18 ) , where X = { 1 , 2 , 5 , 6 , 9 , 10 } .
Theorem 3.
Let T be a subset of { 0 , 1 , , v 1 } Z n , where v is an odd positive divisor of n, with 0 T . The two subsets X , Y Z n satisfy the following conditions:
(i) 
Y = T + v Z n = X v Z n ;
(ii) 
Y ( Y ) = Z n v Z n .
Then the Cayley graph Γ = C ( T 4 n , a X a Y b a X b 2 a Y b 3 ) is a DSRCG with parameters ( 4 n , 2 n , n + l , n l , n + l ) .
Proof. 
Notice that | X | = | Y | l = n l 2 , Λ 1 = C n ¯ a v Z n ¯ and Λ 2 = a v Z n ¯ Λ 1 + l a v Z n ¯ = l C n ¯ . Therefore, 2 a Y ¯ Λ 1 = 2 l a Y ¯ + ( n + l ) C n ¯ and 2 ( a X ¯ Λ 1 + Λ 2 ) = 2 l a X ¯ + ( n + l ) C n ¯ . Thus the result follows from Lemma 10 directly. □
Example 3.
For n = 6 , we have T 24 = { a , b a 6 = b 4 = 1 , b 1 a b = a 1 } . Let T = { 0 , 1 } and v = 3 . Then we have Y = T + 3 Z 6 = { 0 , 1 , 3 , 4 } and X = { 1 , 4 } . Thus we have Y ( Y ) = { 0 , 1 , 3 , 4 , 0 , 5 , 3 , 2 } = Z 6 3 Z 6 , where 3 Z 6 = { 0 , 3 } . Thus the set X satisfies the conditions ( i ) and ( i i ) of Theorem 3. So we have the Cayley graph C ( T 24 , a X a Y b a X b 2 a Y b 3 ) ) is a DSRCG with parameters ( 24 , 12 , 8 , 4 , 8 ) , where X = { 1 , 4 } and Y = { 0 , 1 , 3 , 4 } .

4. Characterization of DSRG C ( T 4 p α , a X a X b a X b 2 a X b 3 )

Firstly, we characterize the DSRCGs C ( T 4 p α , a X a X b a X b 2 a X b 3 ) with p > 2 .
Theorem 4.
Let p be an odd prime and α be a positive integer. Then the Cayley graph C ( T 4 n , a X a X b a X b 2 a X b 3 ) is a DSRCG if and only if there is one β with 0 β α 1 and a subset T 1 , , p α β 1 satisfying the following conditions:
(i) 
X = T + p α β Z p α ;
(ii) 
X ( X ) = Z p α p α β Z p α .
Proof. 
By Theorem 1, we have that C ( T 4 p α , a X a X b a X b 2 a X b 3 ) satisfies conditions (i) and (ii) is a DSRCG.
Conversely, suppose that the Cayley graph C ( T 4 n , a X a X b a X b 2 a X b 3 ) is a DSRCG with parameters ( 4 n , k , μ , λ , t ) , where k = 4 | X | . From (3) of Lemma 14, we have
X ( X ) = Z p α p α β Z p α ,
for some 0 β α 1 , proving (ii).
Therefore,
r ( z ) + r ¯ ( z ) = p α Δ 0 ( z ) p β Δ p β Z p α ( z ) .
Thus Equation (6) becomes
p α Δ 0 ( z ) r ( z ) p β Δ p β Z p α ( z ) r ( z ) = μ 2 n Δ 0 ( z ) + λ μ 2 r ( z ) .
This implies that
r ( z ) = 0 , z p β Z p α .
By Lemma 9, we have X = T + p α β Z p α , where T is a subset of 1 , , p α β 1 , proving (i). □
We now focus on the directed strongly regular Cayley graphs C ( T 2 α + 2 , a X a X b a X b 2 a X b 3 ) .
Lemma 15.
A DSRCG cannot be a Cayley graphs of the form C ( T 2 α + 2 , a X a X b a X b 2 a X b 3 ) with X ( X ) = .
Proof. 
Suppose X ( X ) = . By Lemma 14 (2), we have
X ( X ) = Z 2 α 2 α β Z 2 α .
Similar to the proof of Theorem 4, there is β with 0 β α 1 and a subset T { 1 , , 2 α β 1 } such that X = T + 2 α β Z 2 α and X ( X ) = Z 2 α 2 α β Z 2 α . Thus we have that 2 | X | = 2 | H | 2 β = 2 α 2 β . Then 2 | H | = 2 α β 1 , this is impossible. □
Theorem 5.
The Cayley graphs C ( T 2 α + 2 , a X a X b a X b 2 a X b 3 ) is a DSRCG if and only if there exist one β with 0 β α 1 and a subset T { 1 , , 2 α β 1 } satisfying the following conditions:
(i) 
X = T + 2 α β Z 2 α ;
(ii) 
X ( X ) = ( Z 2 α 2 α β Z 2 α ) ( 2 α β 1 + 2 α β Z 2 α ) ;
(iii) 
X ( 2 α β 1 + X ) = Z 2 α .
Proof. 
It follows from Theorem 2 that the Cayley graph C ( T 2 α + 2 , a X a X b a X b 2 a X b 3 ) satisfying the conditions (i), (ii) and (iii) is a DSRCG.
Conversely, suppose that the Cayley graph C ( T 2 α + 2 , a X a X b a X b 2 a X b 3 ) is a DSRCG with parameters ( 4 n , k = 4 | X | , μ , λ , t ) , then we have X ( X ) by Lemma 15. By Lemma 14 (4) and Equation (3), we have
q ( z ) = ( r + r ¯ ) ( z ) F Δ O β + 1 ( z ) + i = β + 1 F Δ O i ( z ) { 0 , λ μ 2 }
for some 0 β α 1 . Hence k = q ( 0 ) = 2 α and q ( 2 β ) = 2 β + 1 = λ μ 2 . Since k ( k + ( μ λ ) ) = t + ( n 1 ) μ and t = μ by Lemma 11, we have μ = 2 α 2 + 2 β . Since μ < k , we have β α 1 . Thus, by Lemma 11 and Equation (6), we have
r F Δ O β + 1 + 2 α Δ 0 2 β Δ 2 β Z 2 α = μ 2 α Δ 0 2 β + 1 r .
Since ( F Δ O β + 1 ) ( z ) = 0 , we have r ( z ) = ( F Δ X ) ( z ) = 0 for z 2 β Z 2 α . Thus, by Lemma 9, we have X = T + 2 α β Z 2 α , where T { 1 , , 2 α β 1 } , proving ( i ) . Thus we have
r ( z ) = F Δ X ( z ) = 2 β Δ 2 β Z 2 α F Δ T .
So by Equation (8), we have, for z 2 β Z 2 α ,
F Δ H ( z ) F Δ T ( z ) + F Δ T ( z ) ¯ = 2 α β 1 + 2 α β 1 Δ 0 ( z ) 2 F Δ T ( z ) .
Let T = ψ 2 α β ( T ) and Δ T 2 α β = Δ ˜ T . Then T Z 2 α β . Thus, by Lemmas 4, 8 and Equation (9), we have
T T = Z 2 α β O 1 { 0 } = Z 2 α β 2 α β 1 { 0 } .
Since ker ψ 2 α β = 2 α β Z p α , we have
T ( T ) = i + x i : 1 i 2 α β 1 2 α β 1 + y ,
for x 1 , x 2 , , x 2 α β 1 , y 2 α β Z p α . So
X ( X ) = T + 2 α β Z p α T + 2 α β Z p α = Z 2 α 2 α β Z 2 α 2 α β 1 + 2 α β Z 2 α ,
proving ( i i ) . By Lemma 11, we have
a Z 2 α ¯ = a X ¯ + x 2 α β 1 + X ¯ ,
then X ( 2 α β 1 + X ) = Z 2 α , proving (iii). □

5. Characterization of DSRCG C ( T 4 p α , a X a Y b a X b 2 a Y b 3 ) with X Y

Throughout this section, p is assumed to be an odd prime. Let w = r t . Then we have
Lemma 16.
Suppose the Cayley graph C ( T 4 p α , a X a Y b a X b 2 a Y b 3 ) is a DSRCG with X Y . Then Im ( w ) R if and only if Y X is the union of some Z p α -orbits in Z p α . Moreover, if C ( T 4 p α , a X a Y b a X b 2 a Y b 3 ) is a DSRCG with X Y and Im ( w ) R , then Im ( w ) { 0 , λ μ 2 } and Y X = O r 1 O r 1 O r s , for some 0 = r 1 < r 2 < < r s α .
Proof. 
Suppose the Cayley graph C ( T 4 p α , a X a Y b a X b 2 a Y b 3 ) is a DSRG with X Y . If Y X is a union of some Z p α -orbits in Z p α , then Im ( w ) R clearly. If Im ( w ) R , by Lemma 12, we have
w 2 = λ μ 2 w .
Thus we have the two eigenvalues 0 , λ μ 2 are two roots of the quadratic Equation x 2 = λ μ 2 x , so we can get Im ( w ) { 0 , λ μ 2 } Q . Therefore, by Lemma 3, we have Δ X Δ Y = r = 0 α α r Δ O r , for some α r { 0 , 1 } and α 0 = 1 . Thus we have Y X = O r 1 O r 1 O r s , for some 0 = r 1 < r 2 < < r s α . □
In the following theorem, we characterize certain DSRCG C ( T 4 p α , a X a Y b a X b 2 a Y b 3 ) with X Y .
Theorem 6.
Let X , Y be subsets of Z p α with X Y and Y X is a union of some Z p α -orbits with Y X { 0 } . Then the Cayley graph C ( T 4 p α , a X a Y b a X b 2 a Y b 3 ) is a DSRCG if and only if the following conditions holds:
(i) 
Y = T + p β Z p α = X p β Z p α ,
(ii) 
Y ( Y ) = Z p α p β Z p α ,
where 0 < β < α and T is a subset of { 0 , 1 , , p β 1 } .
Proof. 
By Construction 3, we have that the Cayley graph C ( T 4 p α , a X a Y b a X b 2 a Y b 3 ) with conditions (i) and (ii) is a DSRCG.
Conversely, suppose that the Cayley graph C ( T 4 p α , a X a Y b a X b 2 a Y b 3 ) is a DSRG with X Y and Y X is a union of some Z p α -orbits with Y X { 0 } . By Lemma 16, we have Im ( w ) { 0 , λ μ 2 } and Y X = O r 1 O r 1 O r s , for some 0 = r 1 < r 2 < < r s α . Thus w = i = 1 s F Δ O i .
We claim that 0 = r 1 , r 2 , , r s = { 0 , 1 , , s 1 } . To prove this claim, we first assume s > 1 since this claim holds for s = 1 . In fact, if there is an integer u such that r u + 1 > r u + 1 for some 1 u s 1 , by Equation (3), we have
w p r u = i = 1 u μ p r i p r i , p r u φ p r i φ p r i ( p r i , p r u ) = i = 1 u φ p r i < 0 ,
but
w p r s = i = 1 s μ p r i p r i , p r s φ p r i φ p r i ( p r i , p r s ) = i = 1 u φ p r i = i = 1 s φ p r i < i = 1 u φ p r i = w p r u < 0 ,
a contradiction.
Thus r = t + w = t F Δ p β Z p α = t p α β Δ p α β Z p α .
By Lemma 12, we have
t 2 + | t | 2 2 p α β t Δ p α β Z p α = μ 2 p α Δ 0 + λ μ 2 t , t p α β Δ p α β Z p α 2 + | t | 2 = μ 2 p α Δ 0 + λ μ 2 t p α β Δ p α β Z p α .
The difference of these two equations gives
p 2 ( α β ) Δ p α β Z p α = λ μ 2 p α β Δ p α β Z p α .
Since Y X { 0 } , then we have 0 < β < α . Thus we have λ μ 2 = p α β . Similar to the proof about Case 2 of Theorem 7.2 in [6], we can get the conditions (i) and (ii). □

Author Contributions

Conceptualization, T.C., L.T. and L.F.; investigation, L.F. and T.C.; data curation, L.F. and T.C.; writing original draft preparation, L.F. and W.L.; writing review and editing, T.C., L.F. and W.L.; supervision, T.C. and L.F.; project administration, L.F.

Funding

This research was supported by NSFC (Nos. 11671402 and 11871479) (L.F. and W.L.), Hunan Provincial Natural Science Foundation (2016JJ2138 and 2018JJ2479) (L.F. and W.L.) and Mathematics and Interdisciplinary Sciences Project of CSU (L.F. and W.L.), NSFC (No. 11701339) (T.C.), Hunan Provincial Key Laboratory of Mathematical Modeling and Analysis in Engineering (Changsha University of Science & Technology) (L.F.), the Scientific Research Fund of Hunan Provincial Education Department (No. 16A005)(L.F.).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Duval, A.M. A directed graph version of strongly regular graphs. J. Combin. Theory Ser. A 1988, 47, 71–100. [Google Scholar] [CrossRef] [Green Version]
  2. Duval, A.M.; Iourinski, D. Semidirect product constructions of directed strongly regular graphs. J. Combin. Theory Ser. A 2003, 104, 157–167. [Google Scholar] [CrossRef] [Green Version]
  3. Godsil, C.D.; Hobart, S.A.; Martin, W.J. Representations of directed strongly regular graphs. Eur. J. Combin. 2007, 28, 1980–1993. [Google Scholar] [CrossRef] [Green Version]
  4. Gyürki, Š.; Mikhail, K. Sporadic Examples of Directed Strongly Regular Graphs Obtained by Computer Algebra Experimentation (Extended version). In Proceedings of the 16th International Workshop on Computer Algebra in Scientific Computing, Warsaw, Poland, 8–12 September 2014. [Google Scholar]
  5. Klin, M.; Munemasa, A.; Muzychuk, M.; Zieschang, P.H. Directed strongly regular graphs obtained from coherent algebras. Linear Algebra Appl. 2004, 377, 83–109. [Google Scholar] [CrossRef] [Green Version]
  6. He, Y.; Zhang, B.; Feng, R. Directed Strongly Regular Cayley Graphs on Dihedral Groups. arXiv 2018, arXiv:1801.04748v3. [Google Scholar]
  7. Cheng, T.; Feng, L.; Huang, H. Integral Cayley graphs over dicyclic group. Linear Algebra Appl. 2019, 566, 121–137. [Google Scholar] [CrossRef]
  8. Lu, L.; Huang, Q.; Huang, X. Integral Cayley graphs over dihedral groups. J. Algebr. Combin. 2018, 47, 585–601. [Google Scholar] [CrossRef]
  9. James, G.; Liebeck, M. Representations and Characters of Groups, 2nd ed.; Cambridge University Press: Cambridge, UK, 2001. [Google Scholar]
  10. Kohl, T. Groups of order 4p, twisted wreath products and Hopf-Galois theory. J. Algebra 2007, 314, 42–74. [Google Scholar] [CrossRef]
  11. Miklavič, Š.; Potočnik, P. Distance-regular Cayley graphs on dihedral groups. J. Combin. Theory Ser. B 2007, 97, 14–33. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Cheng, T.; Feng, L.; Liu, W. Directed Strongly Regular Cayley Graphs over Metacyclic Groups of Order 4n. Mathematics 2019, 7, 1011. https://doi.org/10.3390/math7111011

AMA Style

Cheng T, Feng L, Liu W. Directed Strongly Regular Cayley Graphs over Metacyclic Groups of Order 4n. Mathematics. 2019; 7(11):1011. https://doi.org/10.3390/math7111011

Chicago/Turabian Style

Cheng, Tao, Lihua Feng, and Weijun Liu. 2019. "Directed Strongly Regular Cayley Graphs over Metacyclic Groups of Order 4n" Mathematics 7, no. 11: 1011. https://doi.org/10.3390/math7111011

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop