| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649565 | Discrete Mathematics | 2009 | 5 Pages |
Abstract
The strongly connected reliability scRel(D,p)scRel(D,p) of a digraph DD is the probability that the spanning subgraph of DD consisting of the operational arcs is strongly connected, given that the vertices always operate, but each arc is independently operational with probability p∈[0,1]p∈[0,1]. We show that the closure of the set of roots of strongly connected reliability polynomials is the whole complex plane.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
J.I. Brown, D. Cox,