Skip to main content
SpringerLink
Log in

Optimal representation of cycles in arithmetic graphs

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The paper considers representation of Hamiltonian circuits by natural arithmetic graphs.

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

Similar content being viewed by others

Literature Cited

  1. Yu. G. Grigoryan and G. K. Manoyan, “Some issues of arithmetic interpretation of graphs,” Kibernetika, No. 3, 129–131 (1977).

    Google Scholar 

  2. G. A. Donets, “On analytically defined graphs,” in: Optimal Decision Theory [in Russian], Inst. Kiber. Akad. Nauk UkrSSR, Kiev (1987), pp. 20–27.

    Google Scholar 

  3. G. A. Donets and Yu. I. Nezhentsev, “Optimal coding of cycles and collections of chains in arithmetic graphs,” in: Optimal Decision Theory [in Russian], Inst. Kiber. Akad. Nauk UkrSSR, Kiev (1990), pp. 30–35.

    Google Scholar 

  4. I. M. Asel'derova, “On optimal coding of some arithmetic graphs,” in: Optimal Decision Theory [in Russian], Inst. Kiber. Akad. Nauk UkrSSR, Kiev (1987), pp. 40–45.

    Google Scholar 

Download references

Authors
  1. Yu. I. Nezhentsev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 17–20, January–February, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nezhentsev, Y.I. Optimal representation of cycles in arithmetic graphs. Cybern Syst Anal 27, 21–26 (1991). https://doi.org/10.1007/BF01068643

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation