Optimally Invulnerable Directed Communication Networks

Algorithms are given to synthesize optimally invulnerable directed graphs with an arbitrary number of vertices and a minimum number of branches. We give a decomposition of these graphs into a class of subgraphs called step-
l
cycles, of which a directed Hamilton cycle is a special case. The use of this property in simultaneous
k
commodity flows is demonstrated.