probabilities) one of the t 1 (I ; possible graphs which can be formed from N, the n (labelled) vertices PI, P?, . . ., P,, by selecting N edges from the i) ; possible edges Px (1 5 i < j 5 n), Thus the effective number of vertices of C,,,lmay be less than n, as some points Pi may be not connected in r,, X with any other point P,; we shall call such points… (More)