Isomorphic factorization of de Bruijn digraphs
Let \(G\) be a directed graph. Define \(L^m(G)\) to be the digraph obtained from \(G\) by applying the line digraph operation \(m\) times. Furthermore, let \(K_d^+\) denote the complete digraph of order \(p\), that is, the digraph constructed from a complete symmetric digraph of order \(p\) by adding a loop to each vertex. The de Bruijn digraph \(B(d,D)\) is defined as \(B(d,D) = L^{D - 1}(K_d^+)\). In this paper, the authors show that a de Bruijn digraph \(B(d^k, D)\) has an isomorphic factorization into \(B(d, kD)\). They generalize this result to the Kronecker product of de Bruijn graphs (extended de Bruijn graphs).
- 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
- Factorization of de Bruijn digraphs by cycle-rooted trees
- On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs
- De Bruijn digraphs and affine transformations
- Unicontour isomorphic factorizations of de Bruijn and Kautz digraphs
- Isomorphisms of the De Bruijn digraph and free‐space optical networks
- Isomorphic factorization, the Kronecker product and the line digraph
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)
