Skip to main content
SpringerLink
Log in

Asymptotic estimates of the degree of connectivity of a random graph

  • 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, I,” Publications Mathematics, No. 6, Debrecen (1959).

  2. P. Erdös and A. Rényi, “On evolution of random graphs,” Magyar Tud. Akad. Mat. Kutato Int. Közl, A5 1, 2 (1960).

    Google Scholar 

  3. V. E. Stepanov, “Combinatorial algebra and random graphs,” Teor. Veroyatn. i Ee Primenen.,14, No. 3, 393–420 (1969).

    Google Scholar 

  4. V. E. Stepanov, “On the probability of the connectivity of the random graph Gm(t),” Theor. Veroyatn. i Ee Primenen.,15, No. 1 (1970).

  5. I. N. Kovalenko, “On the theory of random graphs,” Kibernetika, No. 4 (1971).

  6. V. B. Stepanov, “Phase transitions in random graphs,” Teor. Veroyatn. i Ee Primenen.,15, No. 2, 200–216 (1970).

    Google Scholar 

Download references

Authors
  1. Yu. D. Burtin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 118–122, May–June, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burtin, Y.D. Asymptotic estimates of the degree of connectivity of a random graph. Cybern Syst Anal 9, 505–510 (1973). https://doi.org/10.1007/BF01069208

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation