Factorization of de Bruijn digraphs by cycle-rooted trees

DOI10.1016/S0020-0190(00)00157-5MaRDI QIDQ1603418zbMATH OpenOpenAlexFDO

Authors 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

arc-coloringinterconnection networksde Bruijn digraphline digraph1-factorization

Mathematics Subject Classification ID

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

Recommendations

• Colouring of cycles in the de bruijn graphs
• De Bruijn and Kautz digraphs of a rooted tree
• Isomorphic factorization of de Bruijn digraphs
• On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs
• A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs

Cites work

• scientific article; zbMATH DE number 19210 (Why is no real title available?)
• scientific article; zbMATH DE number 686998 (Why is no real title available?)
• scientific article; zbMATH DE number 979131 (Why is no real title available?)
• Broadcasting and Gossiping in de Bruijn Networks
• Cayley Digraphs Based on the de Bruijn Networks
• 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

Cited in

(4)

• On the structure of the adjacency matrix of the line digraph of a regular digraph
• Isomorphic factorization of de Bruijn digraphs
• On the k-tuple domination of de Bruijn and Kautz digraphs
• Factorizations of cycles and multi-noded rooted trees

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

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