Graphs and Combinatorics

, Volume 3, Issue 1, pp 227–238 | Cite as

On randomlyn-cyclic digraphs

  • Yoshimi Egawa
  • Takashi Miyamoto
  • Sergio Ruiz


A digraphD is called randomlyn-cyclic if for each vertexv ofD, every (directed) path with initial vertexv and having length at mostn − 1 can be extended to av − v (directed) cycle of lengthn. This notion was first introduced by Chartrand, Oellermann and Ruiz [3] and they determined all randomly 3, 4 and 5-cyclic diagraphs. In this paper, we will provide the characterization of randomlyn-cyclic digraphs forn ≥ 6.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chartrand, G., Kronk, H.V., Lick, D.R.: Randomly Hamiltonian digraphs. Fundam. Math.,45, 223–226 (1969)Google Scholar
  2. 2.
    Chartrand, G., Lesniak, L.: Graphs & Digraphs, 2nd edition. Monlerey: Wadsworth 1986Google Scholar
  3. 3.
    Chartrand, G., Oellermann, O. R., Ruiz, S.: Randomlyn-cyclic digraphs. Graphs and Combinatorics1, 29–40 (1985)Google Scholar

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • Yoshimi Egawa
    • 1
  • Takashi Miyamoto
    • 2
  • Sergio Ruiz
    • 3
  1. 1.Department of Applied MathematicsScience University of TokyoTokyoJapan
  2. 2.Department of Information Science, Faculty of ScienceUniversity of TokyoTokyoJapan
  3. 3.Instituto de MathemáticasUniversidad Católica de ValparaísoValparaísoChile

Personalised recommendations