Professional Documents
Culture Documents
On Cubic Symmetric Non-Cayley Graph
On Cubic Symmetric Non-Cayley Graph
On Cubic Symmetric Non-Cayley Graph
c University
d University
Abstract
It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs
with solvable automorphism groups, European J. Combin. 45 (2015), 1-11] that a
cubic symmetric graph with a solvable automorphism group is either a Cayley graph
or a 2-regular graph of type 22 , that is, a graph with no automorphism of order 2
interchanging two adjacent vertices. In this paper an infinite family of non-Cayley
cubic 2-regular graphs of type 22 with a solvable automorphism group is constructed.
The smallest graph in this family has order 6174.
Keywords: Symmetric graph, non-Cayley graph, regular cover.
2010 Mathematics Subject Classification: 05C25, 20B25.
Introduction
Throughout this paper, all groups are finite and all graphs are finite, undirected and
simple. Let G be a permutation group on a set and let . We let G denote
the stabilizer of in G, that is, the subgroup of G fixing the point . The group G is
semiregular on if G = 1 for any , and regular if G is transitive and semiregular.
We let Zn , Zn and Sn denote the cyclic group of order n, the multiplicative group of units
of Zn and the symmetric group of degree n, respectively.
For a graph , we denote its vertex set, edge set and automorphism group by V (),
E() and Aut(), respectively. For a non-negative integer s, an s-arc in a graph is
an ordered (s + 1)-tuple (v0 , . . . , vs ) of vertices of such that vi1 is adjacent to vi for
1 i s, and vi1 6= vi+1 for 1 i < s. Note that a 0-arc is just a vertex. A graph is
(G, s)-arc-transitive or (G, s)-regular for G Aut(), if G is transitive or regular on the
Corresponding author. E-mails: yqfeng@bjtu.edu.cn, klavdija.kutnar@upr.si, dragan.marusic@upr.si,
dwyang@bjtu.edu.cn
Preliminaries
Main result
We first construct connected cubic 2-regular graphs as regular covers of K3,3 .
u
hc
h a
1
e of K if
e = . In this case,
e is a lift of . In particular, K is the lift of the
identify group of Aut(), and if an automorphism Aut() has a lift
e, then K
e are
all lifts of . Let F = NAut( K) (K), the normalizer of K in Aut( K), and let L be
the largest subgroup of Aut() that can be lifted. Since K E F , each automorphism
e in
F induces an automorphism of ( K)K and hence an automorphism of via
, so
e
is a lift of . On the other hand, it is easy to check that the lifts of each automorphism in
L map orbits to orbits of K, and so normalize K. Therefore, there exists an epimorphism
from F to L with kernel K, and thus F/K
= L. For an extensive treatment of regular
covering we refer the reader to [10].
The problem whether an automorphism of lifts can be grasped in terms of voltages
as follows. Observe that a voltage assignment on arcs extends to a voltage assignment on
walks in a natural way. For Aut(), we define a function
from the set of voltages
on fundamental closed walks based at a fixed vertex v in V () to the voltage group K by
((C)) = (C ), where C ranges over all fundamental closed walks at v, and (C) and
(C ) are the voltages of C and C , respectively. The next proposition is a special case
of [10, Theorem 4.2].
Proposition 3.2 If : K 7 is a connected regular K-covering, then an automorphism of lifts if and only if
extends to an automorphism of K.
Now, we are ready to prove Theorem 3.1.
Proof of Theorem 3.1: By Construction, N CG 18n3 is the voltage graph K3,3 K
with the voltage assignment as depicted in Figure 1. Let P : N CG 18n3 7 K3,3 be the
4
covering projection. Let A = Aut(N CG 18n3 ) and F = NA (K). Then L = F/K is the
largest subgroup of Aut(K3,3 ), which can be lifted along P.
Denote by i1 i2 is the cycle having the consecutively adjacent vertices i1 , i2 , . . . , is .
There are four fundamental closed walks based at the vertex u in K3,3 , that is, uyvz,
uzwx, uyvx and uzwy, which are generated by the four cotree arcs (v, z), (w, x), (v, x),
and (w, y), respectively. Since h(v, z), (w, x), (v, x), (w, y)i = hh, h1 a, h1 b, hci =
K, the graph N CG 18n3 is connected.
Define four permutations on V (K3,3 ) as follows:
1 = (uvw), 2 = (xyz), = (ux)(vy)(wz), = (vywz)(ux).
It is easy to check that Aut(K3,3 ) = h1 , 2 , , i
=
= (S3 S3 ) Z2 , and h1 , 2 , i
(Z3 Z3 ) Z4 is 2-regular. Clearly, each involution in h1 , 2 , i fixes the bipartite parts
of K3,3 , and then the subgroup h1 , 2 , i is of type 22 and contains no regular subgroup.
Since 1 = 2 and 2 = 11 , we have that h1 , 2 , i has no normal subgroup of order 3.
Under 1 , 2 , and , each walk of K3,3 is mapped to a walk of the same length. We
list all these walks and their voltages in Table 1, in which C denotes a fundamental closed
walk of K3,3 based at the vertex u and (C) denotes the voltage on C.
C
uyvz
uzwx
uyvx
uzwy
C
uyvz
uzwx
uyvx
uzwy
(C)
h
h1 a
h1 b
hc
(C)
h
h1 a
h1 b
hc
C 1
vywz
vzux
vywx
vzuy
C
xvyw
xwzu
xvyu
xwzv
(C 1 )
hcr
h1 br
2
h1 ar br cr
h
(C )
2
h1 abr cr
har
hbr
2
h1 ar b
C 2
uzvx
uxwy
uzvy
uxwz
C
xwyv
xvzu
xwyu
xvzw
(C 2 )
hb
2
h1 ar c
h1
har
(C )
2
har bcr
2
h1 br
2
h1 ar c
habr
2
Suppose extends to an automorphism of K, say . By Table 1, h = h1 abr cr
2
and (h1 a) = har . Thus a = (h h1 a) = h (h1 a) = h1 abr cr har =
2
2
1 r 2 r
2
By Proposition 2.3, (N CG 18p3 )P is a connected cubic symmetric graph of order 18. By [2],
up to isomorphism, there is only one connected cubic symmetric graph of order 18, that
is, the Pappus graph. Hence N CG 18p3 is a connected 2-regular Z3p -cover of the Pappus
graph with 3 (p 1). These graphs were overlooked in [15, Theorem 3.1].
Acknowledgement: This work was supported by the National Natural Science Foundation of China (11571035, 11231008) and by the 111 Project of China (B16002). The
work of K. K. was supported in part by the Slovenian Research Agency (research program
P1-0285 and research projects N1-0032, N1-0038, J1-6720, J1-6743, and J1-7051), in part
by WoodWisdom-Net+, W3 B, and in part by NSFC project 11561021. The work of D. M.
was supported in part by the Slovenian Research Agency (I0-0035, research program P10285 and research projects N1-0032, N1-0038, J1-5433, J1-6720, and J1-7051), and in part
by H2020 Teaming InnoRenew CoE.
References
[1] M. Aschbacher, Finite Group Theory, Cambridge University Press, Cambridge, 1986.
[2] M. D. E. Conder, Trivalent symmetric graphs on up to 10, 000 vertices,
https://www.math.auckland.ac.nz/ conder/symmcubic10000list.txt.
[3] M. D. E. Conder and R. Nedela, A refined classification of symmetric cubic graphs,
J. Algebra 322 (2009), 722-740.
Djokovic and G. L. Miller, Regular groups of automorphisms of cubic graphs,
[4] D. Z.
J. Combin. Theory Ser. B 29 (1980), 195-30.
[5] Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, European J. Combin. 45 (2015), 1-11.
[6] Y.-Q. Feng and Y.-T. Li, One-regular graphs of square-free order of prime valency,
European J. Combin. 32 (2011), 265-275.
[7] K. Kutnar and D. Marusic, A complete classification of cubic symmetric graphs of
girth 6, J. Combin. Theory Ser. B 99 (2009), 162-184.
Seress, On vertex-transitive non-Cayley graphs of square-free order,
[8] C. H. Li and A.
Des. Codes. Cryptogr. 34 (2005), 265-281.
[9] P. Lorimer, Vertex-transitive graphs: symmetric graphs of prime valency, J. Graph
Theory 8 (1984), 55-68.
[10] A. Malnic, Group actions, coverings and lifts of automorphisms, Discrete Math. 182
(1998), 203-218.
[11] D. Marusic, Cayley properties of vertex symmetric graphs, Ars Combinatorica 16B
(1983), 297-302.
7