首页 | 本学科首页   官方微博 | 高级检索  
     

基于交叉立方体环连接的Petersen图互联网络研究
引用本文:黄新,高太平.基于交叉立方体环连接的Petersen图互联网络研究[J].中北大学学报,2006,27(2):141-143.
作者姓名:黄新  高太平
作者单位:山西大学计算机科学与信息技术学院,山西太原030006
基金项目:中国科学院资助项目 , 山西省自然科学基金
摘    要:交叉立方体是近年来提出的一类互联网络,它有一些比超立方体更好的性质.利用环的简单扩展性,Petersen图的短直径与交叉立方体节点的高可连接性,提出了一种新型互联网络RCP(n)(RingedCrossed cube Petersen),并对其结构特性进行了研究.证明了RCP(n)网络不但具有正则性以及良好的可扩展性,同时还具有比Qn,HP(n),RHP(n)网络更短的直径和更小的构造开销.

关 键 词:  Petersen图  交叉立方体  互联网络
文章编号:1673-3193(2006)02-0141-03
修稿时间:2005年10月29

Research on the Interconnected Networks Based on Ringed Crossed-Cube Petersen
HUANG Xin,GAO Tai-ping.Research on the Interconnected Networks Based on Ringed Crossed-Cube Petersen[J].Journal of North University of China,2006,27(2):141-143.
Authors:HUANG Xin  GAO Tai-ping
Abstract:As a type of interconnected network proposed in recent years,crossed cube possesses some better properties than hypercube.Taking advantage of the simple topology of ring,short diameter of Petersen graph,and high connectivity of crossed-cube,the authors has proposed a new type of interconnected network: RCP(n)(Ringed Crossed-Cube Petersen),and made a research on its structural characteristics.It is proved that RCP(n) is not only of regularity and good extensibility,but also of shorter diameter and less construction costs than such interconnected networks as Q_n,HP(n) and RHP(n).
Keywords:ring  Petersen graph  crossed-cube  interconnected network
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号