1. Calculating bounds on reachability and connectedness in stochastic networks
2. , and , Connectivity extremal problems and the design of reliable probabilistic networks. The Theory and Applications of Graphs (, , , and , Eds.). Wiley, New York (1981) 45–54.
3. , and , On the validity of a reduction of reliable network design to a graph extremal problem. Operations Research (submitted).
4. A general class of invulnerable graphs
5. Circulants and their connectivities