Skip to main content
SpringerLink
Log in

Theory of random graphs

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. P. Erdös and A. Rényi, “On random graphs,” Publ. Math.,6 (1959).

  2. E. N. Gilbert, “Random graphs,” Ann. Math. Statist.,30, No. 4 (1959).

  3. V. E. Stepanov, “Combinatorial algebra and random graphs,” Teoriya Veroyatnostei i Ee Primeneniya,14, No. 3 (1969).

Download references

Authors
  1. I. N. Kovalenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 1–4, July–August, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kovalenko, I.N. Theory of random graphs. Cybern Syst Anal 7, 575–579 (1971). https://doi.org/10.1007/BF01071028

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01071028

Keywords

Search

Navigation