计算机工程与应用2013，Vol.49Issue(5)：81-83,139,4.DOI:10.3778/j.issn.1002-8331.1207-0295
双环Petersen网络直径公式及最优路由算法
Diameter formula and optimal routing algorithm for double-loops Petersen networks
摘要
Abstract
The Double-Loops Connected Petersen Graph network DLCPG(k) is Cartesian product of a double-loop network and the Petersen graph. It has good extensibility, short diameter and simple topology structure. By studying its topology structure, the diameter formula of DLCPG(k) is obtained, and a simple and optimal routing algorithm for the DLCPG(k) is given.关键词
互联网络/直径/双环Petersen图/最优路由Key words
interconnection networks/diameter/double-loops connected Petersen graph/optimal routing分类
信息技术与安全科学引用本文复制引用
魏葆雅,刘日华,陈宝兴..双环Petersen网络直径公式及最优路由算法[J].计算机工程与应用,2013,49(5):81-83,139,4.基金项目
国家自然科学基金(No.60973150) （No.60973150）
福建省自然科学基金(No.2010J01354). （No.2010J01354）
