Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4950838 | Information Processing Letters | 2017 | 5 Pages |
Abstract
Motivated by parallel routing in networks with faults and evaluating the reliability of networks, we consider strong Menger connectivity of the folded hypercube networks. We show that in all n-dimensional folded hypercubes with a vertex set S of nâ1 vertices removed, each pair of unremoved vertices x and y are connected by minâ¡{dGâS(x),dGâS(y)} vertex-disjoint paths (i.e., strong Menger property), where dGâS(x) and dGâS(y) are the remaining degree of vertices x and y in GâS, respectively. Moreover, if there are 2nâ3 vertex faults, and each vertex except for the vertex faults has at least two fault-free adjacent vertices, then all folded hypercube networks still have the strong Menger property.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Weihua Yang, Shuli Zhao, Shurong Zhang,