摘要
本文首先给出了环网G(N;s_1,s_2)存在有限直径的充要条件;用初等数论方法给出了其直径的简明计算公式;最后讨论了类似文献[3]的环网直径的对偶性问题.
Loop networks are cyclical regular diagraphs, which are widely used in the design of local area networks, multimodule memory organizations, data alignments in parallel memory systems, and supercomputer architecture. In this paper, the authors give a necessary and sufficient condition for the existence of finite diameter of loop networks G(N;s_1,s_2) and a simple method for the calculation of this finite diameter. Moreover, a result of the type d(N;s_1,s_2)=d(N;s_1,s'_2) is also given, where s_2+s'_2=N+s_1.
出处
《应用数学》
CSCD
北大核心
1991年第1期90-96,共7页
Mathematica Applicata
