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-
Published in:
Communication Technology, IEEE Transactions on
(Volume:18
,
Issue:
5
)
Date of Publication: October 1970