In this section
@article{Amato:2015:10.1016/j.jctb.2015.03.003,
author = {Amato, D and Evans, DM},
doi = {10.1016/j.jctb.2015.03.003},
journal = {Journal of Combinatorial Theory Series B},
pages = {33--50},
title = {Infinite primitive and distance transitive directed graphs of finite out-valency},
url = {http://dx.doi.org/10.1016/j.jctb.2015.03.003},
volume = {114},
year = {2015}
}
TY - JOUR
AB - We give certain properties which are satisfied by the descendant set of a vertex in an infinite, 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. As a partial converse, we show that certain related conditions on a countable digraph are sufficient for it to occur as the descendant set of a primitive, distance transitive digraph.
AU - Amato,D
AU - Evans,DM
DO - 10.1016/j.jctb.2015.03.003
EP - 50
PY - 2015///
SN - 1096-0902
SP - 33
TI - Infinite primitive and distance transitive directed graphs of finite out-valency
T2 - Journal of Combinatorial Theory Series B
UR - http://dx.doi.org/10.1016/j.jctb.2015.03.003
UR - http://hdl.handle.net/10044/1/26155
VL - 114
ER -