1 research outputs found

    Strong Menger connectedness of augmented kk-ary nn-cubes

    Full text link
    A connected graph GG is called strongly Menger (edge) connected if for any two distinct vertices x,yx,y of GG, there are min⁑{degG(x),degG(y)}\min \{{\rm deg}_G(x), {\rm deg}_G(y)\} vertex(edge)-disjoint paths between xx and yy. In this paper, we consider strong Menger (edge) connectedness of the augmented kk-ary nn-cube AQn,kAQ_{n,k}, which is a variant of kk-ary nn-cube QnkQ_n^k. By exploring the topological proprieties of AQn,kAQ_{n,k}, we show that AQn,3AQ_{n,3} for nβ‰₯4n\geq 4 (resp.\ AQn,kAQ_{n,k} for nβ‰₯2n\geq 2 and kβ‰₯4k\geq 4) is still strongly Menger connected even when there are 4nβˆ’94n-9 (resp.\ 4nβˆ’84n-8) faulty vertices and AQn,kAQ_{n,k} is still strongly Menger edge connected even when there are 4nβˆ’44n-4 faulty edges for nβ‰₯2n\geq 2 and kβ‰₯3k\geq 3. Moreover, under the restricted condition that each vertex has at least two fault-free edges, we show that AQn,kAQ_{n,k} is still strongly Menger edge connected even when there are 8nβˆ’108n-10 faulty edges for nβ‰₯2n\geq 2 and kβ‰₯3k\geq 3. These results are all optimal in the sense of the maximum number of tolerated vertex (resp.\ edge) faults.Comment: 18 pages, 4 figure
    corecore