Generalized activities and \(K\)-terminal reliability (Q1186380)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalized activities and \(K\)-terminal reliability |
scientific article; zbMATH DE number 36532
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized activities and \(K\)-terminal reliability |
scientific article; zbMATH DE number 36532 |
Statements
Generalized activities and \(K\)-terminal reliability (English)
0 references
28 June 1992
0 references
Suppose each edge of a graph \(G\) has a given probability of being useable, and let \(K\) be a subset of the vertex-set of \(G\). This paper presents a polynomial \(R(G,K;t,z)\) that is useful in assessing the probability that the elements of \(K\) will lie in a particular number of components of the useable portion of \(G\), and the probability that a particular number of edges of \(G\) will be useable. The author also extends to this polynomial the activities analysis introduced by Tutte for his dichromatic polynomial.
0 references
terminal reliability
0 references
probabilistic graph
0 references
0 references
0.9839426
0 references
0.84854627
0 references
0.8262761
0 references
0.8218422
0 references
0.8180532
0 references
0.81554306
0 references
