Design to Minimize Diameter on Building-Block Network
From MaRDI portal
Publication:3905213
DOI10.1109/TC.1981.1675809zbMath0456.94030OpenAlexW1903496173MaRDI QIDQ3905213
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1981.1675809
Related Items
On the number of cycles in generalized Kautz digraphs ⋮ Sufficient conditions for maximally connected dense graphs ⋮ On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\) ⋮ Connectivity and fault-tolerance of hyperdigraphs ⋮ On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ Absorbant of generalized de Bruijn digraphs ⋮ Vertex in-magic arc labelings of digraphs ⋮ \(E\)-super vertex in-magic total labelings of digraphs ⋮ Extension of de Bruijn graph and Kautz graph ⋮ A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs ⋮ The Hamiltonian property of the consecutive-3 digraphs ⋮ Communication aspects of networks based on geometric incidence relations ⋮ 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 ⋮ Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks ⋮ An Exact Method for the Minimum Feedback Arc Set Problem ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ New bounds on the decycling number of generalized de Bruijn digraphs ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ Radial Moore graphs of radius three ⋮ High density graphs for processor interconnection ⋮ THE DIAMETER AND HAMILTONIAN CYCLE OF THE GENERALIZED DE BRUIJN GRAPHS UGB(n, n(n+1)) ⋮ Tables of large graphs with given degree and diameter ⋮ Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter ⋮ Hamiltonicity of large generalized de Bruijn cycles ⋮ 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 ⋮ 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 ⋮ Distributed loop network with minimum transmission delay ⋮ Bounds on the absorbant number of generalized Kautz digraphs ⋮ Twin domination in generalized Kautz digraphs ⋮ Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Connectivity of consecutive-\(d\) digraphs ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ Optimization of the critical diameter and average path length of social networks ⋮ The twin domination number in generalized de Bruijn digraphs ⋮ On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ The Hamiltonian property of linear functions ⋮ Large generalized cycles ⋮ Disjoint paths of bounded length in large generalized cycles ⋮ Power domination in generalized undirected de Bruijn graphs and Kautz graphs ⋮ Unnamed Item ⋮ Miscellaneous Digraph Classes ⋮ Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs ⋮ 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
