Skip to main content
SpringerLink
Log in

Structural meaning of some recursion functions of multigraphs

  • 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. V. Matyushkov, “A recursion relation associated with contractions of a graph,” Sib. Mat. Zh., 11, No. 4 (1970).

    Google Scholar 

  2. G. Ergashev, “Structural content of some recursion functions of graphs,” Prikl. Mat. Programm., No. 7 (1972).

  3. A. A. Zykov, “Functions of graphs defined by linear equations,” Izv. Sib. Otd. Akad. Nauk SSSR, No. 12 (1960).

Download references

Authors
  1. G. Ergashev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 15–20, September–October, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ergashev, G. Structural meaning of some recursion functions of multigraphs. Cybern Syst Anal 15, 621–627 (1979). https://doi.org/10.1007/BF01071210

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation