Add to ORKGAbstract. We introduce a construction of highly arc transitive digraphs using a layerwise direct product. This product generalizes some known classes of highly arc transitive digraphs but also allows to construct new such. We use the product to obtain counterexamples to a conjecture by Cameron, Praeger and Wormald on the structure of certain highly arc transitive digraphs. 1
Given integers ▫$k$▫ and ▫$m$▫, we construct a ▫$G$▫-arc-transitive graph of valency ▫$k$▫ and an ▫$...
Let D be a digraph, V (D) and A (D) will denote the sets of vertices and arcs of D, respectively. A ...
AbstractA digraph is k-transitive, if for any a path x0x1…xk of length k, x0 dominates xk. A digraph...
A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group i...
We resolve two problems of [Cameron, Praeger, and Wormald – Infi-nite highly arc transitive digraphs...
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 digraph is said to be highly arc transitive if its automorphism group acts transitively on...
Finite digrahs Г with a group G of automorphisms acting transitively on the set of s-arcs, for some ...
AbstractA directed graph is k-arc transitive if it has an automorphism group which acts transitively...
AbstractIn this paper we investigate infinite, locally finite, connected, transitive digraphs with m...
AbstractWe present a first thorough theoretical analysis of the Transitivity Editing problem on digr...
A digraph D, is said to be k-transitive if for the dipaths Pi: a1a2a3... ak−1ak ∈ E(D) there exist a...
AbstractLet D be a locally finite, connected, 1-arc transitive digraph. It is shown that the reachab...
Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A di...
Given integers ▫$k$▫ and ▫$m$▫, we construct a ▫$G$▫-arc-transitive graph of valency ▫$k$▫ and an ▫$...
Let D be a digraph, V (D) and A (D) will denote the sets of vertices and arcs of D, respectively. A ...
AbstractA digraph is k-transitive, if for any a path x0x1…xk of length k, x0 dominates xk. A digraph...
A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group i...
We resolve two problems of [Cameron, Praeger, and Wormald – Infi-nite highly arc transitive digraphs...
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 digraph is said to be highly arc transitive if its automorphism group acts transitively on...
Finite digrahs Г with a group G of automorphisms acting transitively on the set of s-arcs, for some ...
AbstractA directed graph is k-arc transitive if it has an automorphism group which acts transitively...
AbstractIn this paper we investigate infinite, locally finite, connected, transitive digraphs with m...
AbstractWe present a first thorough theoretical analysis of the Transitivity Editing problem on digr...
A digraph D, is said to be k-transitive if for the dipaths Pi: a1a2a3... ak−1ak ∈ E(D) there exist a...
AbstractLet D be a locally finite, connected, 1-arc transitive digraph. It is shown that the reachab...
Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A di...
Given integers ▫$k$▫ and ▫$m$▫, we construct a ▫$G$▫-arc-transitive graph of valency ▫$k$▫ and an ▫$...
Let D be a digraph, V (D) and A (D) will denote the sets of vertices and arcs of D, respectively. A ...
AbstractA digraph is k-transitive, if for any a path x0x1…xk of length k, x0 dominates xk. A digraph...