Generalized activities and \(K\)-terminal reliability (Q1186380)

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.