Reliability of relay networks structured as a bipartite graph

The paper is concerned with probabilistic networks whose structure is specified as a random complete bipartite graph. An explicit expression is obtained for the probability of connectivity of the entire set of the graph vertices and for that of the set of vertices of one part. These characteristics are asymptotically estimated with increased cardinality of the sets of vertices, graph parts.