Article ID Journal Published Year Pages File Type
427979 Information Processing Letters 2008 6 Pages PDF
Abstract

In this paper, we study the Menger property on a class of hypercube-like networks. We show that in all n-dimensional hypercube-like networks with n−2 vertices removed, every pair of unremoved vertices u and v are connected by min{deg(u),deg(v)} vertex-disjoint paths, where deg(u) and deg(v) are the remaining degree of vertices u and v, respectively. Furthermore, under the restricted condition that each vertex has at least two fault-free adjacent vertices, all hypercube-like networks still have the strong Menger property, even if there are up to 2n−5 vertex faults.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics