Randomlyn-cyclic digraphs |
| |
| Authors: | Gary Chartrand Ortrud R Oellermann Sergio Ruiz |
| |
| Institution: | (1) Department of Mathematics, Western Michigan University, 49008 Kalamazoo, MI, USA;(2) Instituto de Mathematicas, Universidad Católica de Valparaiso, Valparaíso, Chile |
| |
| Abstract: | A digraphD is randomlyn-cyclic (n≥3) 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. Several results related to and examples of randomlyn-cyclic digraphs are presented. Also, all randomlyn-cyclic digraphs forn=3, 4, and 5 are determined.
Research supported by a Western Michigan University faculty research fellowship.
Research supported in part by a College of Arts and Sciences and Graduate College research assistantship from Western Michigan
University. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
