(K, j)-domination and (K, j)-reliability
✍
Rodriguez, Jose; Traldi, Lorenzo
📂
Article
📅
1997
🏛
John Wiley and Sons
🌐
English
⚖ 184 KB
The (K, j)-reliability of a K-terminal network G is the probability that after the failure of some of its edges the vertices in K will lie in no more than j connected components of the resulting subnetwork of G; when j Å 1, this is the usual K-terminal reliability of G. In this paper, we extend the