Descendants in highly arc transitive digraphs

DOI10.1016/S0012-365X(01)00171-6zbMath0991.05054MaRDI QIDQ1598795

Rögnvaldur G. Möller

Publication date: 28 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treedigraphautomorphisms grouphighly arc transitive

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items (17)

Highly arc-transitive digraphs -- structure and counterexamples ⋮ Constructing highly arc transitive digraphs using a direct fibre product ⋮ Descendant-homogeneous digraphs ⋮ A graph-theoretic description of scale-multiplicative semigroups of automorphisms ⋮ Sharply \(k\)-arc-transitive-digraphs: finite and infinite examples ⋮ Infinite arc-transitive and highly-arc-transitive digraphs ⋮ Some constructions of highly arc-transitive digraphs ⋮ Reachability relations in digraphs ⋮ Transitive digraphs with more than one end ⋮ Highly arc transitive digraphs: reachability, topological groups ⋮ Locally-finite connected-homogeneous digraphs ⋮ Descendant sets in infinite, primitive highly arc transitive digraphs with prime power out-valency ⋮ \(k\)-CS-transitive infinite graphs ⋮ Cycle-free partial orders and ends of graphs ⋮ Distance-transitive digraphs: descendant-homogeneity, property \(Z\) and reachability ⋮ Infinite primitive and distance transitive directed graphs of finite out-valency ⋮ On infinite, cubic, vertex-transitive graphs with applications to totally disconnected, locally compact groups

This page was built for publication: Descendants in highly arc transitive digraphs