欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
提出新的无向双环网络G（N；±r，±s）的直径求解法——分步法；并得到一种新的直观图——螺旋环，研究了螺旋环的性质；给出了无向双环网络的直链d（N；±r，±s）的显式公式；给出了N，s都固定的直径算法；在N固定，且2≤r〈s≤N-1时，给出了一族无向双环网络的直径算法．利用VB6．0和SQL Server2000来仿真后者；对任意N，有不少r，s使得G（N；±r，±s）紧优或几乎紧优．验证了Boesch和Wang等提出的元向双环网络G（N；±r，±s）的直径下界；给出了一个新的直径上界公式．
英文摘要：
A new method, step-search-diameter, is presented to calculate the diameter of undirected double-loop networks G（N;±r, ±s）. A new intuitional diagram, spiral ring, is obtained by this method and its attributes were studied. A simple formula for expressing d（N;±r, ±s） of this network is presented. The algorithm to calculate the network with fixed N and s and the one to calculate the diameter of the networks with fixed N and r,s（r〈s） varying to N-1 from 2 are both given. The latter algorithm was simulated by VB6.0 and SQL Server2000. The results show that for any given N, many s make G（N;±r, ±s） tight optimal or nearly tight optimal. The limited bound of the diameter of the network G（N;±r,±s） presented by Boesch and Wang was certified. A new for mula for calculating the upper bound of the diameter of the networks is also given.
同期刊论文项目
同项目期刊论文
期刊信息
位置：