The Disjoint Paths in Enhanced Hypercube

2010 International Conference of Information Science and Management Engineering Pub Date : 2010-08-07 DOI:10.1109/ISME.2010.82

Yanjuan Zhang, Hongmei Liu

引用次数: 1

Abstract

This paper aims to investigate the internally disjoint paths in Q_{n,2}. For this purpose, the structural natures of Q_{n, k}(1 ≤ k ≤ n) are investigated in detail. The properties related to the partition of enhanced hypercube Q_{n,k}. Based on the results, it has been found that for any two distinct vertices x and y there exists n+1 internally disjoint paths connecting x and y, which traverses all vertices of Q_{n,2}. This paper aims to investigate the internally disjoint paths in Q_{n,2}. For this purpose, the structural natures of Q_{n,k}(1 ≤ k ≤ n) are investigated in detail. The properties related to the partition of enhanced hypercube Q_{n,k}. Based on the results, it has been found that for any two distinct vertices x and y there exists n + 1 internally disjoint paths connecting x and y, which traverses all vertices of Q_{n,2}.

查看原文本刊更多论文

增强超立方体中的不相交路径

本文的目的是研究Q_{n,2}中的内不相交路径。为此，Q_{n, k}(1 ≤k & # x2264;N)被详细调查。增强超立方体Q_{n,k}分区的相关性质。根据结果发现，对于任意两个不同的顶点x和y，存在n+1条内部不相交的路径连接x和y，该路径遍历Q_{n,2}的所有顶点。本文的目的是研究Q_{n,2}中的内不相交路径。为此，Q_{n,k}(1 ≤k & # x2264;N)被详细调查。增强超立方体Q_{n,k}分区的相关性质。根据结果发现，对于任意两个不同的顶点x和y，存在n + 1条内部不相交的路径连接x和y，该路径遍历Q_{n,2}的所有顶点。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2010 International Conference of Information Science and Management Engineering

自引率

0.00%

发文量