Connectivity of Imase and Itoh Digraphs

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, ibid., vol.C-32, p.782-4 (1983). 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, 1 1, and d-1 otherwise. >

[1]  Ding-Zhu Du,et al.  Generalized de Bruijn digraphs , 1988, Networks.

[2]  Miguel Angel Fiol,et al.  Line digraph iterations and the (d,k) problem for directed graphs , 1983, ISCA '83.

[3]  Makoto Imase,et al.  A Design for Directed Graphs with Minimum Diameter , 1983, IEEE Transactions on Computers.

[4]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[5]  Charles Delorme,et al.  Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..

[6]  Jean-Claude Bermond,et al.  Large fault-tolerant interconnection networks , 1989, Graphs Comb..

[7]  Makoto Imase,et al.  Connectivity of Regular Directed Graphs with Small Diameters , 1985, IEEE Transactions on Computers.