Degree sequences of random graphs

75Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The paper sets out to investigate the degree sequences d1≥d2≥...≥dn of random graphs of order n in which the edges are chosen independently and with the same probability p, 0

Cite

CITATION STYLE

APA

Bollobás, B. (1981). Degree sequences of random graphs. Discrete Mathematics, 33(1), 1–19. https://doi.org/10.1016/0012-365X(81)90253-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free