Cayley Digraphs Based on the de Bruijn Networks

DOI10.1137/S0895480196288644MaRDI QIDQ4388996zbMATH OpenOpenAlexFDO

Authors M. Espona, Oriol Serra

Publication date 11 May 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480196288644

zbMATH Keywords

Cayley digraphsde Bruijn digraphspermutation networksrouting algorithms

Mathematics Subject Classification ID

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

Recommendations

• Some mathematical properties of cayley digraphs with applications to interconnection network design
• Theory and Applications of Models of Computation
• Large butterfly Cayley graphs and digraphs
• scientific article; zbMATH DE number 1054728
• The Cayley digraph associated to the Kautz digraph.

Cited in

(12)

• Digraphs on permutations
• Uniform homomorphisms of de Bruijn and Kautz networks
• Automorphism groups of k-arc transitive covers.
• Weakly distance-regular digraphs.
• Factorization of de Bruijn digraphs by cycle-rooted trees
• Classification of de Bruijn-based labeled digraphs
• Derangement action digraphs and graphs
• De Bruijn digraphs and affine transformations
• The Cayley digraph associated to the Kautz digraph.
• Shuffle ring network based on group theory
• The complexity of arc-colorings for directed hypergraphs
• The complexity of arc-colorings for directed hypergraphs

This page was built for publication: Cayley Digraphs Based on the de Bruijn Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388996)