超立方体中最短和次短的点不交路径.pdfVIP

Pure Mathematics 理论数学, 2017, 7(4), 230-235 Published Online July 2017 in Hans. /journal/pm /10.12677/pm.2017.74029 Node-Disjoint Shortest and Next-to-Shortest Paths in N-Dimensional Hypercube Yunxia Zhang Shanxi Finance and Taxation College, Taiyuan Shanxi th th th Received: Jun. 12 , 2017; accepted: Jun. 26 , 2017; published: Jun. 30 , 2017 Abstract N-dimensional hypercube is widely used in the field of parallel computer systems. The special to- pological structure of n-dimensional hypercube has significantly affected the performance of large multiprocessor systems. In this article, we prove the following result: In n-dimensional hypercube, for any two nodes with hamming distance that equals to k, there are k node-disjoint shortest paths of length k. Additionally, if we include nest-to-shortest paths of length k + 2 in addition to shortest paths, there will be n node-disjoint paths in total. Keywords Hypercube, Node-Disjoint Path, Shortest Paths, Next-to-Shortest Paths 超立方体中最短和次短的点不交路径 张云霞 山西省财政税务专科学校，山西 太原 收稿日期：2017年6月12 日；录用日期：2017年6月26 日；发布日期：2017年6月30 日 摘 要 n维超立方体在并行计算领域有着广泛的应用，其特殊的拓扑结构对大规模的多处理器系统的性能具有 重要的影响。本文研究n维超立方体 的最短路径问题，采用构造的方法证明了以下结论： 中任意两 Qn Qn 点之间一定存在k条不交的长度为k 的最短路径，其中k为此两点之间的Hamming距离。此外，如果放宽 最短路径的条件，对两点之间的距离为k 的点，长度最多为k +2 的不交路径存在至少n条。 文章引用: 张云霞. 超立方体中最短和次短的点不交路径[J]. 理论数学, 2017, 7(4): 230-235. /10.12677/pm.2017.74029 张云霞 关键词 超立方体，点不交路径，最短路径，次短路径 Copyright © 2017 by author and Hans Publishers Inc. This work is licensed under the Creative Commons Attribution International License (CC BY). /licenses/by/4.0/ Ope