Proceedings I Jornades de Matemμatica Discreta i Algorsmica, pp. 20{23 (Barcelona, 23-24 m.pdfVIP

Proceedings I Jornades de Matemaµtica Discreta i Algor³¶smica, pp. 20{23 (Barcelona, 23-24 marc» 1998), DL B-15.873-98. Covering the vertices of a cycle pre¯x digraph a b F. Comellas , M. Mitjana a Departament de Matemaµtica Aplicada i Telemaµtica, UPC Campus Nord, C3, 08034 Barcelona, Catalonia, Spain. bDepartament de Matemaµtica Aplicada I, UPC c/ Gregorio Maran~on 44, 08028 Barcelona, Catalonia, Spain Abstract Cycle pre¯x digraphs are an interesting family of directed Cayley coset graphs that have been proposed as a model of interconnection networks for parallel architectures. They have many remarkable communication properties such as symmetry, large number of nodes for a given degree and diameter, simple shortest path routing, Hamiltonicity, optimal connectivity, etc. The digraphs can be decomposed into vertex{disjoint cycles of the same length as it was shown in [3]. However, the distribution of tasks of di®erent size in a network should be based in a decomposition of the digraph in vertex{disjoint paths of di®erent length. In this paper we show that the cycle pre¯x digraph ¡¢(D) can be decomposed into one single path with (D + 1)! vertices and ¡¢¡D+k¢ paths of (D ¡ k)D! vertices, k+1 for k = 0 : : : D. 1 Introduction Thorough this paper, ¡ (D) will denote a cycle pre¯x digraph of degree ¢ and diameter ¢ D. These digraphs are de¯ned on an alphabet of ¢ + 1 symbols as follows: Each vertex x x ¢ ¢ ¢ x is a sequence of distinct symbols from the alphabet. The adjacencies are 1 2 D given by 8