Skip to main content
SpringerLink
Log in

Possible utilization of a computer to calculate number of graphs

  • Brief Communications
  • 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

References

  1. C. Berge, Theory of Graphs and Its Applications [Russian translation], IL., Moscow, 1962.

    Google Scholar 

  2. G. Polya, Kombinatorische Anzahibestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Math., 68, 1937.

  3. A. E. Yurtsun, “Principles involved in computing the number of graphs,” JMZh, Kiev, 18, no. 5, 1966.

  4. Yu. V. Kapitonova, “The isomorphism of abstract automata,” Kibernetika [Cyberneties], Kiev, no. 3, 1965.

  5. A. V. Korchagin, N. A. Kharlamov, and O. P. Kudryavtseva, Programming for Electronic Computers [in Russian], izd-vo Ekonomika, Moscow, 1966.

    Google Scholar 

Download references

Authors
  1. A. E. Yurtsun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. M. Moroz
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 4, No. 5, pp. 100–101, 1968 UDC 519.14

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yurtsun, A.E., Moroz, V.M. Possible utilization of a computer to calculate number of graphs. Cybern Syst Anal 4, 74–75 (1968). https://doi.org/10.1007/BF01077181

Download citation

  • Issue Date:

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

Keywords

Search

Navigation