Comellas, F.; Mitjana, M. Cycles in the cycle prefix digraph. (English) Zbl 1071.05540 Ars Comb. 60, 171-180 (2001). Summary: Cycle prefix digraphs are a class of Cayley coset graphs with many remarkable properties such as symmetry, large number of nodes for a given degree and diameter, simple shortest path routing, Hamiltonicity, optimal connectivity, and others. In this paper we show that the cycle prefix digraphs, like the Kautz digraphs, contain cycles of all lengths \(l\), with \(l\) between two and \(N\), the order of the digraph, except for \(N-1\). Cited in 1 Document MSC: 05C38 Paths and cycles 05C20 Directed graphs (digraphs), tournaments Keywords:vertex symmetric digraphs; pancyclicity; Kautz digraphs; interconnection networks PDFBibTeX XMLCite \textit{F. Comellas} and \textit{M. Mitjana}, Ars Comb. 60, 171--180 (2001; Zbl 1071.05540)