Abstract#R##N##R##N#A complete graph has randomly failing nodes and edges. All failures are independent, and there is a common node reliability and a common edge reliability. Generalizing an approach developed by Gilbert for reliable nodes and unreliable edges, we find formulas for various kinds of connectedness probabilities. Bounds and approximations to the probabilities are given.
['Ove Frank', 'W. Gaul']
On reliability in stochastic graphs