Using EDP-polynomials in Optimal Structures Choosing

Using of random graph’s EDP-polynomials in choosing optimal with respect to minimum EDP criterion is observed. Here EDP is the expectation of a number of disconnected pairs of nodes. The vertices are assumed to be perfectly reliable, while the edges fail independently with the same probability. Examples of using EDP-polynomials both for the selection of optimal structures and for proving optimality of some structures in general case are presented.