DIGRAPHS WITH TREE-LIKE DESCENDANT SETS
Daniela A. Amato, David M. Evans · 2010
Abstract. We give certain properties which are satisfied by the descendant set of a vertex in a primitive distance-transitive digraph of finite out-valency and provide a strong structure theory for digraphs satisfying these properties. In particular, we show that there are only countably many possibilities for the isomorphism type of such a descendant set, thereby confirming a conjecture of the first Author.