DocumentCode :
2122580
Title :
The Disjoint Paths in Enhanced Hypercube
Author :
Zhang, Yanjuan ; Liu, Hongmei
Author_Institution :
Coll. of Sci., Three Gorges Univ., Yichang, China
Volume :
1
fYear :
2010
fDate :
7-8 Aug. 2010
Firstpage :
54
Lastpage :
56
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}.
Keywords :
computer networks; graph theory; hypercube networks; disjoint paths; enhanced hypercube; Computer networks; Computers; Fault tolerance; Hypercubes; Joining processes; Network topology; Computer network; Disjoint path; Enhanced Hypercube;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Science and Management Engineering (ISME), 2010 International Conference of
Conference_Location :
Xi´an
Print_ISBN :
978-1-4244-7669-5
Electronic_ISBN :
978-1-4244-7670-1
Type :
conf
DOI :
10.1109/ISME.2010.82
Filename :
5574019
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2122580
بازگشت