Finite edge-transitive bi-circulants

https://doi.org/10.1016/j.amc.2021.126268Get rights and content

Highlights

  • We have considered carefully each comment of the reviewer, and made corresponding changes in the revision.

  • We believe these changes are correct and suitable.

  • We have also improved some presentations of the paper.

Abstract

This work studies edge-transitive bi-circulants of order 2n with Zn being a Hall subgroup of the full automorphism groups. The automorphism groups of such graphs are completely determined. As an application, a classification is given of bipartite edge-transitive bi-circulants of order 2n with valency less than the smallest prime divisors of n. This also leads to a new construction of an infinite family of arc-regular bi-circulants.

Introduction

For a undirected and simple graph Γ, we express by AutΓ its full automorphism group. If there is an automorphism group X acting transitively on VΓ (vertex set), EΓ (edge set) or AΓ (arc set) of Γ, then Γ is called X-vertex-transitive, X-edge-transitive or X-arc-transitive, respectively. If X is transitive on EΓ but intransitive on VΓ, then Γ is called X-semisymmetric.

A graph Γ admitting a semiregular automorphism group G with exactly two orbits on VΓ is called a bi-Cayley graph on G. In particular, Γ is called normal if G is normal in AutΓ, and Γ is called a bi-circulant if G is cyclic. The family of bi-circulants involves Cayley graphs on dihedral groups, the generalized Petersen graphs [8], Rose-Window graphs [25] and Tabačjn graphs [1]. Edge-transitive bi-circulants have obtained much attention in the literature, see [8], [23] for valency 3, [17] for valency 4, [1], [5] for valency 5 and [13], [28] for valency 6. For more results, refer to [4], [21], [22], [26], [27].

Bi-circulant is a natural generalization of circulant (Cayley graph on a cyclic group). However, in sharp contrast with edge-transitive circulants (which were classified by Kovaćs [16] and Li [19]), the problem for classifying edge-transitive bi-circulants is widely open. In fact, the known results are mainly for small valency. This work aims to study edge-transitive bipartite bi-circulants Γ of order 2n with a Hall subgroup of AutΓ isomorphic to Zn. (Recall a subgroup H is called a Hall subgroup of a group G if |G:H| is coprime to |H|). The first assertion determines the automorphism groups of such graphs.

Theorem 1.1

Let Γ be a connected bipartite edge-transitive bi-circulant on a group GZn, with G a Hall subgroup of AutΓ. Denote by (AutΓ)+ the stabilizer of AutΓ on the bipartitions of Γ. Then AutΓ=(AutΓ)+.Z2 is arc-transitive on Γ, and the following statements hold.

  • (1)

    If AutΓ is soluble, then (AutΓ)+=Zn:H and Γ is normal arc-regular, where HZn*.

  • (2)

    If AutΓ is insoluble, then(AutΓ)+=((Zm:L)×T1×T2××Tl).P,where mn, l1, LZm*, (Ti,(Ti)α)=(M11,A6.Z2),(M23,M22),(PSL(2,11),A5), (As,As1) or (PSL(d,q),P1) with P1 a maximal parabolic subgroup of PSL(d,q), and POut(T1)×Out(T2)××Out(Tl), such that (n,|Ti|)>1 but (m,|Ti|)=(n,|Ti|,|Tj|)=1 for ij.

For convenience, we express byspd(n)thesmallestprimedivisorofapositiveintegern.As an application of Theorem 1.1, edge-transitive bipartite bi-circulants of order 2n with valency less than spd(n) are determined. Graphs appearing in the theorem are described in Section 2.1.

Theorem 1.2

Let Γ be a connected bipartite edge-transitive bi-circulant of order 2n, and suppose 3val(Γ)<spd(n). Then Γ is arc-transitive, and one of the following holds.

  • (1)

    Γ=BiCay(G,,,S) is normal arc-regular, with SG.

  • (2)

    Γ=Kp,ppK2 with p5 a prime, and AutΓ=Sp×Z2.

  • (3)

    Γ=HD(22,5,2) or HD(22,6,2), and AutΓ=PGL(2,11).

  • (4)

    Γ=PH(d,q) or PH(d,q), and AutΓ=PΓL(d,q).Z2, where d3 and qd1q1 is a prime.

  • (5)

    Γ=C2m×biHD(22,5,2), with spd(m)13.

  • (6)

    Γ=Σ1×biPH(d,q) or Σ1×biPH(d,q), where Σ1 is a normal arc-regular bi-circulant of order 2m, d3, and qd1q1 is a prime such that val(Σ1)·qd11q1<spd(mqd1q1).

Using properties of normal edge-transitive bi-Cayley graphs (see [4, Proposition 3.4] and [27, Theorem 1.1]), the normal arc-regular bi-circulants in parts (1) and (6) can be constructed in a straightforward way, see Lemma 3.4 for a description of such graphs for prime valency.

Constructing arc-regular graphs is a hot topic in the literature. Kwak et al. [18] constructed an infinite family of arc-regular dihedrants for any prescribed valency, and Feng and Li [7] determined arc-regular dihedrants of any prime valency. Our Theorem 1.2 leads to a new construction of an infinite family of arc-regular bi-circulants.

Theorem 1.3

Let G=aZn. Suppose n is not a prime and has no prime divisors 11 and qd1q1 with d3 and q a prime power, and suppose k<spd(n) and l is a solution of the equationxk1+xk2++x+10(modn).Then the bi-circulantBiCay(a,,,{1,a,a1+l,,a1+l++lk2})is arc-regular.

We remark that the conditions ‘n is not a prime, and has no prime divisors 11 and qd1q1’ are necessary. For otherwise, the bi-circulants in Theorem 1.3 includes the graphs Kn,nnK2, HD(22,5,2) and the Heawood graph of order 14, but all of them are not arc-regular.

Section snippets

Examples

There are some typical bi-circulants: C2n, the cycle of length 2n; K2n, the complete graphs of 2n vertices; Kn,n, the complete bipartite graph of valency n; Kn,nnK2, the graph deleted a 1-match from Kn,n. It is easy to see the graphs C2n and K2n are bi-circulants on Zn/2, and Kn,n and Kn,nnK2 are bi-circulants on Zn.

Two sporadic examples are arisen from bipartite designs: HD(22,5,2) and HD(22,6,2), the incidence and non-incidence graphs of Hadamard design on 22 points. It is known that val(HD(

A few lemmas

We prove several lemmas in this section that will be used in the sequel. Express by Z(X) the center and X the commutator subgroup of a group X.

Lemma 3.1

Let X=N.(T1×T2××Tl), where NZm and T1,T2,,Tl are nonabelian simple groups. Then NZ(X), and either

  • (i)

    XT1×T2××Tl and X=N×X; or

  • (ii)

    there is a prime pm such that Sylow p-subgroups of X are nonabelian.

Proof

Set C=CX(N). Then NCX. Observe X/CAut(N)Zm*, and C/NX/NT1×T2××Tl, we easily deduce C=X, namely NZ(X). Similarly, because NX/NX/N and (X/N)/(XN/N)

Proof of Theorem 1.1

In this section, we prove Theorem 1.1 by a series of lemmas.

Let Γ be a connected bipartite X-arc-transitive bi-circulant on G=aZn with n odd, and suppose G is a Hall subgroup of X.

Set π the set of primes dividing n, and set Δ1,Δ2 the bipartitions of Γ. Let X+=XΔ1=XΔ2, the stabilizer of X on Δ1 and Δ2. Then X+ is of index 2 in X, and Xα=Xα+ for αVΓ. Since G/(GX+)GX+/X+X/X+Z2, and G is of odd order, we deduce GX+ is regular on Δ1 and Δ2. By Frattini argument, X+=GXα, so Xα is a π-group.

Proofs of Theorems 1.2 and 1.3

Let Γ be a connected bipartite edge-transitive bi-circulant on G=aZn, with 3k:=val(Γ)<spd(n), and let Δ1 and Δ2 be the bipartitions of Γ. Write A=AutΓ and A+=AΔ1. Then n is odd and Aα=Aα+ for αVΓ. Denote by π the set of primes dividing n. The edge-transitivity of Γ implies AαΓ(α)σk, and the connectivity of Γ forces that |Av| and |AvΓ(v)| have the same prime divisors, we deduce Aα is a π-group because k<spd(n). Since n is odd, and G/(GA+)GA+/A+A/A+Z2, we get GA+ is regular on Δi. By

Acknowledgments

The authors thank the referee for some helpful comments.

References (28)

  • P.J. Cameron

    Finite permutation groups and finite simple groups

    Bull. London Math. Soc.

    (1981)
  • A. Devillers, M. Giudici, W. Jin, Arc-transitive bicirculants,...
  • J.D. Dixon et al.

    Permutation Groups

    (1996)
  • R. Frucht et al.

    The groups of the generalized petersen graphs

    Proc. Camb. Philos. Soc.

    (1971)
  • Cited by (0)

    This paper was partially supported by the National Natural Science Foundation of China (11961076, 11461007).

    View full text