A design methodology for synthesizing parallel algorithms and architectures
Journal of Parallel and Distributed Computing
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
Arrangement graphs: a class of generalized star graphs
Information Processing Letters
On the diameter vulnerability of Kautz digraphs
Discrete Mathematics - Special issue on graph theory and combinatorics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Comments on "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four"
IEEE Transactions on Parallel and Distributed Systems
De bruijn communications networks.
De bruijn communications networks.
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 0.04 |
Let D be a directed graph; the (l,@w)-Independence Number of graph D, denoted by @a"l","@w(D), is an important performance parameter for interconnection networks. De Bruijn networks and Kautz networks, denoted by B(d,n) and K(d,n) respectively, are versatile and efficient topological structures of interconnection networks. For l=1,2,...,n, this paper shows that @a"l","d"-"1(B(d,n))=d^n,@a"l","d"-"1(K(d,n))=@a"l","d(K(d,n))=d^n+d^n^-^1 if d=3 and n@?d-2. In particular, the paper shows the exact value of the Independence Number for B(d,1) and B(d,2) for any d. For the generalized situation, the paper obtains a lower bound @a"l","d"-"1(B(d,n))=d^2 if n=3 and d=5.