Skip to main content
SpringerLink
Log in

Coding and generation of nonisomorphic trees

  • 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. F. Harary, Graph Theory, Addison-Wesley (1969).

  2. R. Bassacker and T. Saati, Finite Graphs and Networks [Russian translation], Nauka, Moscow (1974).

    Google Scholar 

  3. V. N. Zemlyachenko, “On the isomorphism of trees,” Proc. Seminar on Combinatorial Mathematics, in: Questions of Cybernetics [in Russian], Moscow (1973).

  4. J. E. Hopcroft and R. E. Tarjian, “Isomorphism of planar graphs,” in: Cybernetic Collection [Russian translation], New Series, No. 12, Mir (1975).

  5. M. Gordon and J. W. Kennedy, “The counting and coding of trees of fixed diameter,” SIAM J. Appl. Math., 28, No. 2 (1975).

    Google Scholar 

  6. G. Prins, “The automorphism group of a tree,” Doctoral Dissertation, University of Michigan (1957).

  7. W. T. Tutte, “A theory of three-connected graphs,” Indag. Math.,23 (1961).

Download references

Authors
  1. A. V. Kozina
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 38–43, September–October, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kozina, A.V. Coding and generation of nonisomorphic trees. Cybern Syst Anal 15, 645–651 (1979). https://doi.org/10.1007/BF01071214

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation