Generalized de Bruijn digraphs
From MaRDI portal
Publication:3800064
DOI10.1002/net.3230180105zbMath0654.05036OpenAlexW2029894006MaRDI QIDQ3800064
Publication date: 1988
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230180105
Related Items (43)
Absorbant of generalized de Bruijn digraphs ⋮ Characterization of \(c\)-circulant digraphs of degree two which are circulant ⋮ A unified formulation of Kautz network and generalized hypercube ⋮ Extension of de Bruijn graph and Kautz graph ⋮ A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs ⋮ Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II ⋮ Large fault-tolerant interconnection networks ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph ⋮ A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants ⋮ An Exact Method for the Minimum Feedback Arc Set Problem ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ Super link-connectivity of iterated line digraphs. ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ THE DIAMETER AND HAMILTONIAN CYCLE OF THE GENERALIZED DE BRUIJN GRAPHS UGB(n, n(n+1)) ⋮ Unnamed Item ⋮ Hamiltonicity of large generalized de Bruijn cycles ⋮ Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields ⋮ Efficient twin domination in generalized de Bruijn digraphs ⋮ The Hamiltonian property of generalized de Bruijn digraphs ⋮ On the diameter of the generalized undirected de Bruijn graphsUGB(n,m),n2<m≤n3 ⋮ Multidimensional linear congruential graphs ⋮ On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs ⋮ Hamilton cycles in Trivalent Cayley graphs ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Connectivity of consecutive-\(d\) digraphs ⋮ Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs ⋮ EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS ⋮ ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS ⋮ An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph ⋮ On embedding cycles into faulty twisted cubes ⋮ Generalized de Bruijn graphs ⋮ The twin domination number in generalized de Bruijn digraphs ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Topological properties of twisted cube ⋮ The Hamiltonian property of linear functions ⋮ Large generalized cycles ⋮ Recursive circulants and their embeddings among hypercubes ⋮ On endo-Cayley digraphs: the Hamiltonian property ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs ⋮ The Hamiltonian property of consecutive-\(d\) digraphs ⋮ Counting closed walks in generalized de Bruijn graphs
This page was built for publication: Generalized de Bruijn digraphs
