GENERATION OF VERTEX CONNECTED SUBGRAPHS FOR MULTIINPUT MULTIOUTPUT RELIABILITY NETWORKS

In this paper, the problem of evaluation of reliability (probability o f success) of a network consisting of several inputs and outputs is st udied. Edges are assumed to be perfect and vertices are assigned the p robabilities of success. A new concept called ''vertex connected subgr aph'' is introduced for this purpose. This concept is useful even for dense graphs because they are of the order of 2((v-k-1)) which is inde pendent of e, where v(e) is the number of vertices (edges) and k is th e number of outputs of a graph.