We consider four models of random directed multigraphs with n labeled
vertices of out-degree d. First we establish formal relationships betw
een our models with respect to exact and asymptotic (as n --> infinity
) probabilities of possessing a graph monotone property. We also study
the asymptotic behavior of the strength of connectivity of the underl
ying simple graphs when d = o(n).