Skip to main content
SpringerLink
Log in

An estimate of the minimum diameter for a class of 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. L. Kleinrock, Communication Nets, McGraw-Hill (1964).

  2. S. Ya. Zaslavskii, “The structure of a version of an associative network,” Kibernetika, No. 3, (1965).

  3. V. A. Lovitskii, “The problem of estimating the organization of associative networks,” Problemy Bioniki, No. 1 (1968).

  4. W. R. Graham, “Parallel and pipeline computers,” Datamation,16, Pril (1970).

  5. C. Berge, Graph Theory and Its Applications [Russian translation] IL, Moscow (1962).

    Google Scholar 

Download references

Authors
  1. L. S. Lozinskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 118–121, May–June, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lozinskii, L.S. An estimate of the minimum diameter for a class of graphs. Cybern Syst Anal 8, 485–489 (1972). https://doi.org/10.1007/BF01069006

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation