Connectivity of Imase and Itoh digraphs
Nathalie Homobono, Claudine Peyrat · IEEE Transactions on Computers · 1988
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, 11, and d-1 otherwise.>