AbstractWe construct continuum many non-isomorphic countable digraphs which are highly arc transitive, have finite out-valency and infinite in-valency, and whose automorphism groups are primitive
We resolve two problems of [Cameron, Praeger, and Wormald – Infi-nite highly arc transitive digraphs...
AbstractIt is shown that, contrary to a pair of well-known conjectures, there exist finite and infin...
A group G of permutations of a set Ω is primitive if it acts transitively on Ω, and the only G-invar...
AbstractWe construct continuum many non-isomorphic countable digraphs which are highly arc transitiv...
AbstractThe descendant set desc(α) of a vertex α in a directed graph (digraph) is the subdigraph on ...
Finite digrahs Г with a group G of automorphisms acting transitively on the set of s-arcs, for some ...
AbstractFor finite q, we classify the countable, descendant-homogeneous digraphs in which the descen...
© 2015 The Authors.We give certain properties which are satisfied by the descendant set of a vertex ...
AbstractA digraph is connected-homogeneous if any isomorphism between finite connected induced subdi...
AbstractA digraph is said to be highly arc transitive if its automorphism group acts transitively on...
AbstractWe give certain properties which are satisfied by the descendant set of a vertex in an infin...
A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group i...
Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981....
In this research note we introduce St-Nicolas graphs, i.e. circulant digraphs showing exactly n maxi...
Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981....
We resolve two problems of [Cameron, Praeger, and Wormald – Infi-nite highly arc transitive digraphs...
AbstractIt is shown that, contrary to a pair of well-known conjectures, there exist finite and infin...
A group G of permutations of a set Ω is primitive if it acts transitively on Ω, and the only G-invar...
AbstractWe construct continuum many non-isomorphic countable digraphs which are highly arc transitiv...
AbstractThe descendant set desc(α) of a vertex α in a directed graph (digraph) is the subdigraph on ...
Finite digrahs Г with a group G of automorphisms acting transitively on the set of s-arcs, for some ...
AbstractFor finite q, we classify the countable, descendant-homogeneous digraphs in which the descen...
© 2015 The Authors.We give certain properties which are satisfied by the descendant set of a vertex ...
AbstractA digraph is connected-homogeneous if any isomorphism between finite connected induced subdi...
AbstractA digraph is said to be highly arc transitive if its automorphism group acts transitively on...
AbstractWe give certain properties which are satisfied by the descendant set of a vertex in an infin...
A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group i...
Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981....
In this research note we introduce St-Nicolas graphs, i.e. circulant digraphs showing exactly n maxi...
Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981....
We resolve two problems of [Cameron, Praeger, and Wormald – Infi-nite highly arc transitive digraphs...
AbstractIt is shown that, contrary to a pair of well-known conjectures, there exist finite and infin...
A group G of permutations of a set Ω is primitive if it acts transitively on Ω, and the only G-invar...
DOI
Add to ORKG