Strategies for interconnection networks: some methods from graph theory
Journal of Parallel and Distributed Computing
Line digraph iterations and the (d,k) problem for directed graphs
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Graphs and Hypergraphs
On connectivity of consecutive-d digraphs
Discrete Mathematics - Kleitman and combinatorics: a celebration
Note: super link-connectivity of iterated line digraphs
Theoretical Computer Science
The k-tuple twin domination in generalized de Bruijn and Kautz networks
Computers & Mathematics with Applications
Cryptography and Security
| Hi-index | 14.98 |
An important problem in the design of efficient interconnection networks consists of finding digraphs with a minimal diameter for a given number of nodes n and a given degree d. The best family known at present, denoted by G(n,d), has been proposed by Imase and Itoh. Its vertex set is the set of integers modulo n and its arc set A is defined as A=((x,y)/y identical to -dx-a, 1or=aor=d). The authors determine the connectivity of these digraphs, which proves that they are highly reliable. More precisely, we show that provided that the diameter is greater than 4, the connectivity of G(n,d) is d if n=k(d+1) and gcd(n,d)