1-arc-transitive digraph

Definition

We say is an arc-transitive digraph, if is transitive on the edge-set.

Note that a star is not vertex transitive. And is transitive on if is regular, i.e., in-valency of each point is equal. Thus is an orbital graph of on , that is, a graph whose vertex set is and edge set is an orbit of acting on .

Definition

Let be the paired orbital graph of , i.e. if , then . Let be the out-neighbor of and be the in-neighbor of .

Lemma

A regular digraph is -arc-transitive iff is transitive on and is transitive on (or ).

\begin{proof} Easy. \end{proof}

2-arc-transitive digraph

Definition

We say is a -arc-transitive digraph if has -arcs and is transitive on the set of -arcs of .

Lemma

Let be a -vertex-transitive digraph. Then is -arc-transitive on iff

  • is transitive on ;
  • is transitive on where is an arc of .

\begin{proof} The proof is similar to lemma 1. \end{proof}

Proposition

Let be a connected -arc-transitive digraph which is not undirected. Then is -arc-transitive iff where is a -arc.

\begin{proof} Suppose is -arc-transitive. Let be a -arc. Then is a -arc for any . Thus there is a such that . By Frattini’s argument, .

Conversely, assume for a -arc . Let be a -arc. Since is arc-transitive, there is a such that . Let . Then . Since , is a transitive subgroup of on . Then there is a such that . Hence . \end{proof}

s-arc-transitive digraph

Proposition

Let be a connected -arc-transitive digraph which is not undirected. Then is -arc-transitive iff where is an -arc, .

\begin{proof} Assume is -arc-transitive. Then is transitive on and so for . By Frattini’s argument we have .

Conversely, suppose for any . Take any -arcs and . By being -arc-transitive, there is s.t. . Since , is transitive on and so there is s.t. . Repeat the procedure and the proof is completed. \end{proof}

Constructions

A trivial example of highly-arc-transitive digraph is a lexicographical product , whose automorphism group is and so is -arc-transitive.

In the following part, we give a non-trivial construction of -arc-transitive digraph.

Case 1:

Recall the definition of coset graph. Define , where and is an arc iff . Since is directed, we know .

Let , where and , reading . Let and .

Claim 1: is -arc transitive. Label on and on , respectively. Then is an -arc and . Note that

and

Thus and so is -arc transitive by ^e1odoe.

Claim 2: . Since , acts on is equivalent to acts on by coset action. Then , where is the kernel of on , i.e. the core of in . As is abelian, . So . Similarly, , completing the proof.

Case 2: for a general

Let , where and , reading . Let and . Claim that is -arc transitive.

Label on and let , . Then is an -arc. Note that , and with . Then for any . Similarly, we can prove that is -arc-transitive and .

Remark.

  • If instead of , then .
  • This example is not isomorphic to donut, as is not a subgroup of .
  • is a normal subgroup. The quotient graph is called Praeger graph. Praeger-Xu graph is also mentioned, although I did not understand its definition.