Abstract & Overview
We consider graphs with n vertices and m edges constructed from n isolated vertices by selecting among them, uniformly at random, m pairs and connecting them by m edges. The variance of the vertex degrees of such graphs is shown to be equal to 2m (n - n ? 2m)/(n 3+ n ) . In order to arrive at this formula some combinatorial identities are verified.