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