| 基于交叉立方体环连接的Petersen图互联网络研究 |
| |
| 引用本文： | 郭璞.基于交叉立方体环连接的Petersen图互联网络研究[J].科技情报开发与经济,2006,16(3):157-158. |
| |
| 作者姓名： | 郭璞 |
| |
| 作者单位： | 山西警官高等专科学校,山西太原,030012 |
| |
| 摘 要： | 利用环的简单扩展性以及Petersen图的短直径与交叉立方体节点的高可连接性,提出了一种新型互联网络RCP(n),并对其性质进行了一些研究,证明了RCP(n)网络不但具有正则性以及良好的可扩展性,同时还具有比Qn,HP(n),RHP(n)网络更短的直径和更小的构造开销。
|
| 关 键 词： | 环 Petersen图 交叉立方体 互联网络 |
| 文章编号： | 1005-6033（2006）03-0157-02 |
| 收稿时间： | 2005-12-26 |
| 修稿时间： | 2005年12月26 |
Research on the Petersen Graph Interconnection Network Based on the Cross Cube Ring |
| |
| GUO Pu.Research on the Petersen Graph Interconnection Network Based on the Cross Cube Ring[J].Sci-Tech Information Development & Economy,2006,16(3):157-158. |
| |
| Authors: | GUO Pu |
| |
| Abstract: | On the basis of the simple topology of ring and the high connectivity of the short diameter of Petersen graph and the nodes of the cross cube,this paper puts forward a novel interconnection network,RCP(n)(Ringed Crossed cube Connected Petersen),and researches on its characteristics,which proves that RCP(n)possesses not only the regularity and good extensibility,but also the shorter diameter and smaller construction costs than those previously well-known interconnection networks such as Qn HP(n)and RHP(n). |
| |
| Keywords: | ring Petersen graph crossed cube interconnection network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
