The Disjoint Paths in Enhanced Hypercube
This paper aims to investigate the internally disjoint paths in Qn,2. For this purpose, the structural natures of Qn,k(1 ≤ k ≤ n) are investigated in detail. The properties related to the partition of enhanced hypercube Qn,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 Qn,2. This paper aims to investigate the internally disjoint paths in Qn,2. For this purpose, the structural natures of Qn,k(1 ≤ k ≤ n) are investigated in detail. The properties related to the partition of enhanced hypercube Qn,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 Qn,2.
Computer network Enhanced Hypercube Disjoint path
Yanjuan Zhang Hongmei Liu
College of Science Three Gorges University Yichang 443002
国际会议
西安
英文
54-56
2010-08-07(万方平台首次上网日期,不代表论文的发表时间)