Statistics based on a theory of random graphs have been proposed as an analytic aid to assess the randomness of a clustered structure. Probability tables for two such statistics are tabulated. Exact values ofPn,v, the cumulative probabilities of the minimum number of edges needed to connect a random graph, are tabulated forn= 10(1)30(5)80-(10)100. Exact and approximate values ofEn,v, the expected number of components in a random graph withnvertices andvedges, are tabulated forn= 10(1)30(5)100.