Topological groups and infinite graphs
Discrete Mathematics
An infinite highly arc-transitive digraph
European Journal of Combinatorics
A Conjecture Concerning a Limit of Non-Cayley Graphs
Journal of Algebraic Combinatorics: An International Journal
Highly arc transitive digraphs: reachability, topological groups
European Journal of Combinatorics
Reachability relations in digraphs
European Journal of Combinatorics
k-CS-transitive infinite graphs
Journal of Combinatorial Theory Series B
Descendant-homogeneous digraphs
Journal of Combinatorial Theory Series A
Hi-index | 0.05 |
A digraph is said to be highly arc transitive if its automorphism group acts transitively on the set of s-arcs for all s ≥ 0. The set of descendants of a directed line is defined as the set of all vertices that can be reached by a directed path from some vertex in the line. The structure of the subdigraph in a locally finite highly arc transitive digraph spanned by the set of descendants of a line is described and this knowledge is used to answer a question of Cameron, Praeger and Wormald. In addition another question of Cameron, Praeger and Wormald is settled.