Isomorphic factorization of de Bruijn digraphs

DOI10.1016/S0012-365X(99)00304-0MaRDI QIDQ1978156zbMATH OpenFDO

Authors Yukio Shibata, Toru Hasunuma, Sanae Fukuda

Publication date 11 December 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Kronecker productfault-toleranceinterconnection networksline digraphsisomorphic factorizationde Bruijn digraphsextended de Bruijn digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Unicontour isomorphic factorizations of de Bruijn and Kautz digraphs
• Isomorphic factorisation of graphs
• scientific article; zbMATH DE number 26476
• scientific article; zbMATH DE number 1367495
• Factorization of de Bruijn digraphs by cycle-rooted trees
• Isomorphic factorization, the Kronecker product and the line digraph
• Isomorphic factorization of the complete graph into Cayley digraphs
• scientific article; zbMATH DE number 4101256
• On isomorphic factorizations of circulant graphs
• An isomorphic factorization of the complete graph

Cited in

(6)

• De Bruijn digraphs and affine transformations
• Isomorphisms of the De Bruijn digraph and free‐space optical networks
• Unicontour isomorphic factorizations of de Bruijn and Kautz digraphs
• Factorization of de Bruijn digraphs by cycle-rooted trees
• Isomorphic factorization, the Kronecker product and the line digraph
• On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs

This page was built for publication: Isomorphic factorization of de Bruijn digraphs

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