Skip to main content
SpringerLink
Log in

Classification and statistical features of arithmetic 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. Yu. G. Grigor'yan and G. K. Manoyan, “Arithmetic interpretation of unoriented graphs,” Kibernetika, No. 3 (1977).

  2. S. V. Yablonskii, “Functional construction in K-valued logic,” Tr. Mat. Inst. Akad. Nauk SSSR,51 (1958).

  3. V. M. Glushkov, Digital Automaton Synthesis [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

  4. Yu. I. Zhuravlev, “Set theoretic methods in logic algebra,” in: Cybernetics Problems [in Russian], No. 8, Fizmatgiz, Moscow (1962).

    Google Scholar 

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

    Google Scholar 

  6. A. A. Zykov, Theory of Finite Graphs [in Russian], Nauka, Moscow (1968).

    Google Scholar 

  7. F. Harary, Graph Theory, Addison-Wesley (1969).

  8. H. Cramer, Mathematical Methods of Statistics, Princeton Univ. (1946).

Download references

Authors
  1. Yu. G. Grigor'yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 9–12, November–December, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grigor'yan, Y.G. Classification and statistical features of arithmetic graphs. Cybern Syst Anal 15, 783–786 (1979). https://doi.org/10.1007/BF01069383

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation