Classes of uniformly most reliable graphs for all-terminal reliability

On unreliability polynomials and graph connectivity in reliable network synthesis

F Boesch · Journal of Graph Theory · 1986 · 131 citations

Network Theory (Electrical Engineering), Engineering, Network Robustness +24

On graphs with randomly deleted edges

Alexander Kelmans · Acta Mathematica Academiae Scientiarum Hungaricae · 1981 · 106 citations

Network Science, Graph Theory, Random Graph +8

Uniformly‐most reliable networks do not always exist

Wendy Myrvold, Kim H. Cheung, Lavon B. Page et al. · Networks · 1991 · 87 citations

Geometric Graph Theory, Uniformly‐most Reliable Networks, Network Science +14

On the existence of uniformly optimally reliable networks

F Boesch, X. Li, C Suffel · Networks · 1991 · 85 citations

Network Theory (Electrical Engineering), Engineering, Reliable Networks +20

A proof of Boesch's conjecture

Guifang Wang · Networks · 1994 · 54 citations

Network Theory (Electrical Engineering), Engineering, Reliable Graph +20