Design to Minimize Diameter on Building-Block Network

Cited in

(56)

On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
Sufficient conditions for maximally connected dense graphs
Communication aspects of networks based on geometric incidence relations
Large fault-tolerant interconnection networks
High density graphs for processor interconnection
Tables of large graphs with given degree and diameter
The Hamiltonian property of generalized de Bruijn digraphs
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
Distributed loop network with minimum transmission delay
Connectivity of consecutive-d digraphs
Super edge-connectivity of dense digraphs and graphs
Large generalized cycles
Disjoint paths of bounded length in large generalized cycles
Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
The Hamiltonian property of consecutive-\(d\) digraphs
Counting closed walks in generalized de Bruijn graphs
On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\)
Connectivity and fault-tolerance of hyperdigraphs
A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
The Hamiltonian property of the consecutive-3 digraphs
Super line-connectivity of consecutive-\(d\) digraphs
Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
Distance domination of generalized de Bruijn and Kautz digraphs
Efficient absorbants in generalized de Bruijn digraphs
The Hamiltonian property of linear functions
On the number of cycles in generalized Kautz digraphs
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
Optimization of the critical diameter and average path length of social networks
Constructing the minimum dominating sets of generalized de Bruijn digraphs
On the k-tuple domination of de Bruijn and Kautz digraphs
Absorbant of generalized de Bruijn digraphs
Hamiltonicity of large generalized de Bruijn cycles
The diameter and Hamiltonian cycle of the generalized de Bruijn graphs \(UG_{\text{B}}(n,n(n+1))\)
Bounds on the absorbant number of generalized Kautz digraphs
Twin domination in generalized Kautz digraphs
Miscellaneous digraph classes
Vertex in-magic arc labelings of digraphs
E-super vertex in-magic total labelings of digraphs
On the diameter of the generalized undirected de Bruijn graphsUG_B(n,m),n²<m≤n³
The k-tuple twin domination in generalized de Bruijn and Kautz networks
Radial Moore graphs of radius three
Multidimensional linear congruential graphs
New bounds on the decycling number of generalized de Bruijn digraphs
Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
On the decycling number of generalized Kautz digraphs
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
scientific article; zbMATH DE number 7310081 (Why is no real title available?)
Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications
Power domination in generalized undirected de Bruijn graphs and Kautz graphs
On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
Generalized de Bruijn words, invertible necklaces, and the Burrows-Wheeler transform
Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
The twin domination number in generalized de Bruijn digraphs

This page was built for publication: Design to Minimize Diameter on Building-Block Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3905213)