We consider two types of random configuration graphs: with the power-law and with the Poisson vertex degree distributions. The parameters of these distributions are fixed. By simulations we estimate the probabilities of graph connectivity (when all graph vertices are joined into one connected component) in different graph types and their dependence on the graph size and the vertex degree distribution parameter.