Generalized de Bruijn digraphs

DOI10.1002/NET.3230180105MaRDI QIDQ3800064zbMATH OpenOpenAlexFDO

Authors Du Ding-Zhu, Frank K. Hwang

Publication date 1988

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230180105

zbMATH Keywords

diameterconnectivitydirected graphsde Bruijn graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

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

(51)

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

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)