Skip to main content
SpringerLink
Log in

Adjacent coding of vertices of a 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. V. M. Giushkov, Design of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

  2. Yu. V. Kapitonova, “Coding of abstract automata by C-codes,” Kibernetika, No. 1 (1965).

  3. K. Berzh, Theory of Graphs and Its Application [in Russian], IL, Moscow (1962).

    Google Scholar 

  4. V. S. Mikhalevich and I. Z. Shor, “Numerical solution of multivariant problems by the method of successive analysis of variants,” in: Proceedings of the Economics-Mathematics Seminar [in Russian], Vol. 1, Izd. LÉMI Akad. Nauk SSSR (1962).

Download references

Authors
  1. V. V. Yaremenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 35–40, January–February, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yaremenko, V.V. Adjacent coding of vertices of a graph. Cybern Syst Anal 11, 40–45 (1975). https://doi.org/10.1007/BF01069941

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation