zbMATH — the first resource for mathematics

Cayley digraphs based on the de Bruijn networks. (English) Zbl 0916.05028
A construction of Cayley digraphs associated to the de Bruijn digraphs (which can be described as iterated line digraphs of complete symmetric digraphs) is presented. Invariants and properties as routings, hamiltonicity, degree of symmetry of the resulting Cayley digraphs are investigated. From the abstract: These results can be applied to the design of permutation networks. By using the same construction, a Cayley digraph of the symmetric group on the nodes of the de Bruijn digraph of degree two is obtained.

05C20 Directed graphs (digraphs), tournaments
94C15 Applications of graph theory to circuits and networks
Full Text: DOI