Name
Abstract | ||
|---|---|---|
We consider the undirected simple connected graph for which edges fail independently of each other with equal probability 1 - p and nodes are perfect. The all-terminal reliability of a graph G is the probability that the spanning subgraph of surviving edges is connected, denoted as R(G,p). Graph G ⋯ ω(n,e) is said to be uniformly least reliable if R(G, p) ≤ R(G', p) for all G' ⋯ ω(n, e), and for all edge failure probabilities 0 < 1 - p < 1. In this paper, we prove the existence of uniformly least reliable graphs in the class ω(n, e) for e ≤ n +1 and give their topologies. |
Year | DOI | Venue |
|---|---|---|
2010 | null | Ars Combinatoria |
Keywords | Field | DocType |
All-terminal reliability,Boesch's conjecture,Uniformly least reliable graphs | Discrete mathematics,Graph,Combinatorics,Mathematics | Journal |
Volume | Issue | ISSN |
97 | null | null |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huajun Meng | 1 | 12 | 1.61 |
| Fang-ming Shao | 2 | 41 | 4.42 |
| Xiwen Lu | 3 | 182 | 21.03 |