On the design of reliable networks
S. L. Hakimi, Ashok T. Amin · Networks · 1973
Abstract This paper is concerned with construction of graphs, with n vertices and m edges, whose connectivity r = [2m/n] ≧ 3, and have no more than n minimum vertex cut‐sets. Frank's results imply that this is an important step in the design of a class of reliable networks.