On randomlyn-cyclic digraphs |
| |
| Authors: | Yoshimi Egawa Takashi Miyamoto Sergio Ruiz |
| |
| Affiliation: | (1) Department of Applied Mathematics, Science University of Tokyo, Shinjuku-ku, 162 Tokyo, Japan;(2) Department of Information Science, Faculty of Science, University of Tokyo, Hongo, Bunkyo-ku, 113 Tokyo, Japan;(3) Instituto de Mathemáticas, Universidad Católica de Valparaíso, Valparaíso, Chile |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
