Properties of connectivity components in parallel-sequantial connections

In this paper recursive formulas for a calculation of generating functions, distributions and moments of random number of connectivity components in parallel-sequential graphs and their connectivity probabilities are obtained. For graphs with large number of arcs variants of the law of large numbers and the central limit theorem are formulated and proved.