A new property of binary undirected de Bruijn graphs
From MaRDI portal
Recommendations
- On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs
- On the connectivity of the De Bruijn graph
- On the diameter of the generalized undirected de Bruijn graphs.
- A new look at the de Bruijn graph
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
- A New Proof and a Generalization of a Theorem of De Bruijn
- scientific article; zbMATH DE number 2050882
- scientific article; zbMATH DE number 5551599
- New bounds on the decycling number of generalized de Bruijn digraphs
Cited in
(8)- Routing and transmitting problems in de Bruijn networks
- The undirected de Bruijn graph: fault tolerance and routing algorithms
- Graphs with the unique path property: Structure, cycles, factors, and constructions
- On the diameter of the generalized undirected de Bruijn graphs.
- scientific article; zbMATH DE number 2177306 (Why is no real title available?)
- scientific article; zbMATH DE number 2075779 (Why is no real title available?)
- On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs
- The diameter and Hamiltonian cycle of the generalized de Bruijn graphs \(UG_{\text{B}}(n,n(n+1))\)
This page was built for publication: A new property of binary undirected de Bruijn graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1976593)
