Strong Menger connectedness of augmented $k$-ary $n$-cubes
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao

TL;DR
This paper investigates the strong Menger connectivity of augmented $k$-ary $n$-cubes, demonstrating their robustness against vertex and edge faults, with optimal fault tolerance bounds established.
Contribution
It establishes the strong Menger (edge) connectivity of augmented $k$-ary $n$-cubes under high fault conditions, extending known properties of these network topologies.
Findings
$AQ_{n,3}$ for $n extgreater 3$ is strongly Menger connected with up to $4n-9$ faulty vertices.
$AQ_{n,k}$ for $n extgreater 1$, $k extgreater 3$ remains strongly Menger connected with up to $4n-8$ faulty vertices.
$AQ_{n,k}$ is strongly Menger edge connected with up to $4n-4$ faulty edges, even under vertex degree restrictions.
Abstract
A connected graph is called strongly Menger (edge) connected if for any two distinct vertices of , there are vertex(edge)-disjoint paths between and . In this paper, we consider strong Menger (edge) connectedness of the augmented -ary -cube , which is a variant of -ary -cube . By exploring the topological proprieties of , we show that for (resp.\ for and ) is still strongly Menger connected even when there are (resp.\ ) faulty vertices and is still strongly Menger edge connected even when there are faulty edges for and . Moreover, under the restricted condition that each vertex has at least two fault-free edges, we show that is still strongly Menger edge connected even when…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
