We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Electrical Engineering/The variance of the vertex degrees of randomly generated graphs
PeriodicalsElectrical Engineering

The variance of the vertex degrees of randomly generated graphs

Checking your access to this record.

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.

Cite this record

İvan Gutman, Peter Paule (2002). The variance of the vertex degrees of randomly generated graphs. Publikacija Elektrotehnickog fakulteta - serija matematika, (13), 30–35. https://doi.org/10.2298/petf0213030g

Copy in another style

Gutman, İ., & Paule, P. (2002). The variance of the vertex degrees of randomly generated graphs. Publikacija Elektrotehnickog fakulteta - serija matematika, 30–35. https://doi.org/10.2298/petf0213030g
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.