Generalized de Bruijn digraphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 827972
- Generalized de Bruijn graphs
- Generalized de Bruijn graphs
- scientific article; zbMATH DE number 857070
- scientific article; zbMATH DE number 1893584
- Generalized de Bruijn cycles
- Generalized de Bruijn multigraphs of rank \(\overarrow k\)
- The Hamiltonian property of generalized de Bruijn digraphs
- Absorbant of generalized de Bruijn digraphs
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
Cited in
(52)- The asymptotic number of acyclic digraphs. II
- Large fault-tolerant interconnection networks
- The Hamiltonian property of generalized de Bruijn digraphs
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
- Connectivity of consecutive-d digraphs
- Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
- On the number of labeled acyclic digraphs
- An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph
- Large generalized cycles
- The Hamiltonian property of consecutive-\(d\) digraphs
- Counting closed walks in generalized de Bruijn graphs
- Characterization of \(c\)-circulant digraphs of degree two which are circulant
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
- Super line-connectivity of consecutive-\(d\) digraphs
- Super link-connectivity of iterated line digraphs.
- Recursive circulants and their embeddings among hypercubes
- Classification of de Bruijn-based labeled digraphs
- Efficient absorbants in generalized de Bruijn digraphs
- Topological properties of twisted cube
- The Hamiltonian property of linear functions
- Generalized de Bruijn digraphs and the distribution of patterns in \(\alpha\)-expansions
- Extension of de Bruijn graph and Kautz graph
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. II
- Constructing the minimum dominating sets of generalized de Bruijn digraphs
- Absorbant of generalized de Bruijn digraphs
- A unified formulation of Kautz network and generalized hypercube
- Hamiltonicity of large generalized de Bruijn cycles
- On embedding cycles into faulty twisted cubes
- On endo-Cayley digraphs: the Hamiltonian property
- The diameter and Hamiltonian cycle of the generalized de Bruijn graphs \(UG_{\text{B}}(n,n(n+1))\)
- On the diameter of the generalized undirected de Bruijn graphsUGB(n,m),n2<m≤n3
- scientific article; zbMATH DE number 5711445 (Why is no real title available?)
- On the twin domination number in generalized de Bruijn and generalized Kautz digraphs
- DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph
- scientific article; zbMATH DE number 166082 (Why is no real title available?)
- The k-tuple twin domination in generalized de Bruijn and Kautz networks
- Multidimensional linear congruential graphs
- On the (h,k)-domination numbers of iterated line digraphs
- scientific article; zbMATH DE number 1471732 (Why is no real title available?)
- Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
- scientific article; zbMATH DE number 2089975 (Why is no real title available?)
- Efficient twin domination in generalized de Bruijn digraphs
- On efficient absorbant conjecture in generalized de Bruijn digraphs
- An exact method for the minimum feedback arc set problem
- Bidirectional Variable-Order de Bruijn Graphs
- Eulerian and Hamiltonian dicycles in directed hypergraphs
- Generalized de Bruijn graphs
- A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
- Hamilton cycles in Trivalent Cayley graphs
- Generalized de Bruijn words, invertible necklaces, and the Burrows-Wheeler transform
- The twin domination number in generalized de Bruijn digraphs
This page was built for publication: Generalized de Bruijn digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3800064)