Abstract
A stochastic network is considered the underlying deterministic graph of which is assumed to be undirected and connected. This graph is split into two edge—disjoint subgraphs by a given separating vertex set. Reliability analysis is carried out for the corresponding stochastic subgraphs and the results are combined to obtain a formula of the K—terminal reliability of the stochastic network. Special cases are discussed in detail and numerical examples are presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
