Skip to main content
SpringerLink
Log in

On characterization of periodic digraphs

  • Published:
Cybernetics Aims and scope

Abstract

We investigate the problem of describing subgraphs of periodic digraphs. A necessary and sufficient condition is obtained for a digraph to be a subgraph of a periodic digraph.

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. P. D. Straffin, “Periodic points of continuous functions,” Math. Mag.,51, No. 2, 99–105 (1978).

    Google Scholar 

  2. A. N. Sharkovskii, “Coexistence of cycles and continuous transformations of the straight line into itself, Ukr. Mat. Zh.,16, No. 1, 61–71 (1964).

    Google Scholar 

  3. Chung-wu Ho and Ch. Morris, “A graph-theoretic proof of Sharkovsky's theorem on the periodic points of continuous function,” Pac. J. Math.,96, No. 2, 361–370 (1981).

    Google Scholar 

  4. V. A. Pavlenko, “On periodic digraphs and their properties,” Ukr. Mat. Zh.40, No. 4, 528–532 (1988).

    Google Scholar 

  5. O. Ore, Theory of Graphs, AMS, Providence, RI (1962).

    Google Scholar 

Download references

Authors
  1. V. A. Pavlenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 41–44, January–February, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pavlenko, V.A. On characterization of periodic digraphs. Cybern Syst Anal 25, 49–54 (1989). https://doi.org/10.1007/BF01074883

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation