Residual Connectedness Network Reliability. (Reannouncement with New AvailabilityInformation)

摘要

There is an extensive literature on the reliability model of an undirected graphwhose edges operate with independent probabilities but whose nodes are perfectly reliable. Herein we consider the less studied case where the nodes operate with independent probabilities but the edges are perfectly reliable. The reliability function Rn in this case is the probability that the operating nodes are contained in a connected induced subgraph. A source of the known results concerning analysis and synthesis problems related to Rn is given here.