Cayley Digraphs Based on the de Bruijn Networks

DOI10.1137/S0895480196288644zbMath0916.05028OpenAlexW1965083881MaRDI QIDQ4388996

Oriol Serra, M. Espona

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

de Bruijn digraphsrouting algorithmspermutation networksCayley digraphs

Mathematics Subject Classification ID

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

Related Items (7)

Automorphism groups of \(k\)-arc transitive covers. ⋮ Weakly distance-regular digraphs. ⋮ The complexity of arc-colorings for directed hypergraphs ⋮ The complexity of arc-colorings for directed hypergraphs ⋮ Derangement action digraphs and graphs ⋮ De Bruijn digraphs and affine transformations ⋮ Factorization of de Bruijn digraphs by cycle-rooted trees

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