A new method for constructing infinite families of k-tight optimal double loop networks  

作　　者：CHEN Xiebin 

机构地区：[1]Department of Mathematics and Information Science, Zhangzhou Teachers College, Zhangzhou 363000,China

出　　处：《Science China Mathematics》2006年第4期525-532,共8页中国科学：数学（英文版）

基　　金：supported by the Natural Science Foundation of Fujian Province of China(Grant No.A0510021);the National Natural Science Foundation of China(Grant No.10271114).

摘　　要：The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented.method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.

关 键 词：INTERCONNECTION network  double loop network  CIRCULANT digraph  diameter k-tight optimal. 

分 类 号：N[自然科学总论]