Factorization of de Bruijn digraphs by cycle-rooted trees

DOI10.1016/S0020-0190(00)00157-5zbMath0996.68128OpenAlexW2064769957MaRDI QIDQ1603418

N. Fujikake, Hiroyuki Kawai, Yukio Shibata

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00157-5

zbMATH Keywords

interconnection networksline digraph1-factorizationarc-coloringde Bruijn digraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ On the structure of the adjacency matrix of the line digraph of a regular digraph

Cites Work

• Connectivity of Regular Directed Graphs with Small Diameters
• Group Action Graphs and Parallel Architectures
• On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs
• Broadcasting and Gossiping in de Bruijn Networks
• Cayley Digraphs Based on the de Bruijn Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Factorization of de Bruijn digraphs by cycle-rooted trees