On the characterization of the domination of a diameter-constrained network reliability model
Let G=(V,E) G = ( V , E ) be a digraph with a distinguished set of terminal vertices K?V K ? V and a vertex s?K s ? K . We define the s,K s , K -diameter of G as the maximum distance between s and any of the vertices of K . If the arcs fail randomly and independently with known probabilities (vertices are always operational), the diameter-constrained s,K s , K -terminal reliability of G , Rs,K(G,D) R s , K ( G , D ) , is defined as the probability that surviving arcs span a subgraph whose s,K s , K -diameter does not exceed D. The diameter-constrained network reliability is a special case of coherent system models, where the domination invariant has played an important role, both theoretically and for developing algorithms for reliability computation. In this work, we completely characterize the domination of diameter-constrained network models, giving a simple rule for computing its value: if the digraph either has an irrelevant arc, includes a directed cycle or includes a dipath from s to a node in K longer than D , its domination is 0; otherwise, its domination is -1 - 1 to the power |E|-|V|+1 | E | - | V | + 1 . In particular this characterization yields the classical source-to-K-terminal reliability domination obtained by Satyanarayana. Based on these theoretical results, we present an algorithm for computing the reliability.
domination network reliability graph theory diameter