Network reliability with node failures
β
Liu, Shaobin; Cheng, Kam-Hoi; Liu, Xiaoping
π
Article
π
2000
π
John Wiley and Sons
π
English
β 101 KB
Given a graph whose edges never fail but whose nodes fail independently of each other with a constant probability 1 ---p p p, the reliability of a graph is defined to be the probability that the induced subgraph of the surviving nodes is connected. Let β¦ (n n n, m m m) be the class of all graphs wit