Cycles in the Cycle Prefix Digraph.
F. Comellas(*), M. Mitjana(#)
(*) Departament de Matemàtica Aplicada i Telemàtica;
Universitat Politècnica de Catalunya
(#) Departament de Matemàtica Aplicada I;
Universitat Politècnica de Catalunya
Ars Combinatoria 60, pp. 171--180 (2001)
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.
Load a preprint version of the paper: