1 research outputs found

    Node-to-node disjoint paths in k-ary n-cubes with faulty edges.

    No full text
    Let u and v be any two given nodes in a k-ary n-cube Qnk with at most 2n-2 faulty edges. Suppose that the number of healthy links incident with u is no more than that of v, and denote this number by m. In this paper, we show that there are m mutually node-disjoint paths between u and v
    corecore