A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
From MaRDI portal
Recommendations
Cites work
- A new look at the de Bruijn graph
- A Scheme for Fast Parallel Communication
- Design to Minimize Diameter on Building-Block Network
- Fault-tolerant routings in Kautz and de Bruijn networks
- Generalized de Bruijn digraphs
- Group Action Graphs and Parallel Architectures
- scientific article; zbMATH DE number 3912382 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- Line Digraph Iterations and the (d, k) Digraph Problem
- Methods and problems of communication in usual networks
- On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs
- The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
- The underlying graph of a line digraph
Cited in
(13)- Factorization of de Bruijn digraphs by cycle-rooted trees
- De Bruijn and Kautz digraphs of a rooted tree
- Generalized de Bruijn digraphs and the distribution of patterns in \(\alpha\)-expansions
- Extension of de Bruijn graph and Kautz graph
- A new property of binary undirected de Bruijn graphs
- On total regularity of mixed graphs with order close to the Moore bound
- On the twin domination number in generalized de Bruijn and generalized Kautz digraphs
- Generalized de Bruijn digraphs
- Comments on "Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs"
- Power domination in generalized undirected de Bruijn graphs and Kautz graphs
- Eulerian and Hamiltonian dicycles in directed hypergraphs
- A note on recursive properties of the de Bruijn, Kautz and FFT digraphs
- Isomorphic factorization, the Kronecker product and the line digraph
This page was built for publication: A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364476)