On the construction of most reliable networks Original Research Article

The construction of most reliable networks is investigated. In particular, the study of restricted edge connectivity shows that general Harary graphs are max λ–min mi for all i=λ, λ+1,…,2λ−3. As a consequence, this implies that for each pair of positive integers n and e, there is a graph of n vertices and e edges that is max λ–min mi for all i=λ,λ+1,…,2λ−3. General Harary graphs that are max λ–min mi for all i=λ,λ+1,…,2λ−2 are also constructed.