Infinite primitive and distance transitive directed graphs of finite out-valency.

Daniela A. Amato David M. Evans

Published in: J. Comb. Theory, Ser. B (2015)

Keyphrases

directed graph
random walk
finite sets
directed acyclic graph
maximum flow
strongly connected
transitive closure
disjoint paths
distance measure
euclidean distance
distance metric
undirected graph
edge weights
distance function
graph structure
graph structures
computational complexity
special case
lower bound