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

Star网络S_5的Hamilton圈分解
引用本文:路建波,师海忠.Star网络S_5的Hamilton圈分解[J].数学的实践与认识,2010,40(4).
作者姓名:路建波  师海忠
作者单位:西北师范大学,数学与信息科学学院,甘肃,兰州,730070
基金项目:国家自然科学基金(10771091)
摘    要:最近Star网络和Pancake网络作为超立方体(并行计算机中多处理机互连的一种著名拓扑结构)的替代品而被许多作者研究.这两种网络的一个好的特点是:与超立方体相比较,它们有较小的直径和顶点度.尤其Star网络,更是受到研究人员的极大关注.在本文中:(a)我们提出了一种在这两种网络中找Hamilton圈的新方法.(b)证明了关于Star网络S_n的一个猜想在n=5时是正确的,即给出了S_5的两个边不交的Hamilton圈,且S_5是这两个Hamilton圈的并.

关 键 词:Cayley图  Hamilton圈  Star网络  Pancake网络

Decomposition of Star Network S5 into Hamilton Cycles
LU Jian-bo,SHI Hai-zhong.Decomposition of Star Network S5 into Hamilton Cycles[J].Mathematics in Practice and Theory,2010,40(4).
Authors:LU Jian-bo  SHI Hai-zhong
Institution:LU Jian-bo,SHI Hai-zhong (College of Mathematics , Information Science,Northwest Normal University,Gansu 730070,China)
Abstract:In recent times star and pancake networks as alternatives to hypercube(for interconnecting processors on a parallel computer) has been examined by a number of re-searchers. An attractive feature of these two classes of graphs is that they have small diameter and degree.Stax networks,especially,are interested in many researchers.In this paper:(a) We proposed a new algorithm for embedding Hamiltonian cycle in these two classes of graphs. (b) We proved that the conjecture about star networks S_nis right for n ...
Keywords:cayley graph  hamiltonian cycle  star network  pancake network  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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