Finite digrahs Г with a group G of automorphisms acting transitively on the set of s-arcs, for some s ⩾ 2, are investigated. For each valency v and each s ⩾ 2 an infinite family of finite digraphs of valency v which are s-arc transitive but not (s + 1)-arc transitive are constructed. These examples are the result of a general construction given in the paper. Several classification results are proved and the case of G primitive on vertices is discussed
AbstractTwo new infinite families of locally 3-arc transitive graphs are constructed which have Aut(...
AbstractThe descendant set desc(α) of a vertex α in a directed graph (digraph) is the subdigraph on ...
Abstract. We introduce a construction of highly arc transitive digraphs using a layerwise direct pro...
Finite digrahs Г with a group G of automorphisms acting transitively on the set of s-arcs, for some ...
A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group i...
AbstractA digraph is k-arc transitive if it has a group of automorphisms which acts transitively on ...
An $s$-arc in a digraph $\Gamma$ is a sequence $v_0,v_1,\ldots,v_s$ of vertices such that for each $...
AbstractA directed graph is k-arc transitive if it has an automorphism group which acts transitively...
AbstractA hypergraph is s-arc transitive if its automorphism group acts transitively on the set of i...
We resolve two problems of [Cameron, Praeger, and Wormald – Infi-nite highly arc transitive digraphs...
AbstractBy theorems of Tutte, Weiss, and others, it is known that there are no finite symmetric grap...
Let Gamma be a simple graph and let G be a group of automorphisms of Gamma. The graph is (G, 2)-arc ...
AbstractA digraph is said to be highly arc transitive if its automorphism group acts transitively on...
Let Gamma be a simple graph and let G be a group of automorphisms of Gamma. The graph is (G, 2)-arc ...
AbstractThe action of a subgroup G of automorphisms of a graph X is said to be half-arc-transitive i...
AbstractTwo new infinite families of locally 3-arc transitive graphs are constructed which have Aut(...
AbstractThe descendant set desc(α) of a vertex α in a directed graph (digraph) is the subdigraph on ...
Abstract. We introduce a construction of highly arc transitive digraphs using a layerwise direct pro...
Finite digrahs Г with a group G of automorphisms acting transitively on the set of s-arcs, for some ...
A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group i...
AbstractA digraph is k-arc transitive if it has a group of automorphisms which acts transitively on ...
An $s$-arc in a digraph $\Gamma$ is a sequence $v_0,v_1,\ldots,v_s$ of vertices such that for each $...
AbstractA directed graph is k-arc transitive if it has an automorphism group which acts transitively...
AbstractA hypergraph is s-arc transitive if its automorphism group acts transitively on the set of i...
We resolve two problems of [Cameron, Praeger, and Wormald – Infi-nite highly arc transitive digraphs...
AbstractBy theorems of Tutte, Weiss, and others, it is known that there are no finite symmetric grap...
Let Gamma be a simple graph and let G be a group of automorphisms of Gamma. The graph is (G, 2)-arc ...
AbstractA digraph is said to be highly arc transitive if its automorphism group acts transitively on...
Let Gamma be a simple graph and let G be a group of automorphisms of Gamma. The graph is (G, 2)-arc ...
AbstractThe action of a subgroup G of automorphisms of a graph X is said to be half-arc-transitive i...
AbstractTwo new infinite families of locally 3-arc transitive graphs are constructed which have Aut(...
AbstractThe descendant set desc(α) of a vertex α in a directed graph (digraph) is the subdigraph on ...
Abstract. We introduce a construction of highly arc transitive digraphs using a layerwise direct pro...