ISSN:
1435-5914
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract 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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01788545
Permalink