The edge connectivity of expanded \(k\)-ary \(n\)-cubes (Q1727252)

Summary: Mass data processing and complex problem solving have higher and higher demands for performance of multiprocessor systems. Many multiprocessor systems have interconnection networks as underlying topologies. The interconnection network determines the performance of a multiprocessor system. The network is usually represented by a graph where nodes (vertices) represent processors and links (edges) represent communication links between processors. For the network \(G\), two vertices \(u\) and \(v\) of \(G\) are said to be connected if there is a \((u, v)\)-path in \(G\). If \(G\) has exactly one component, then \(G\) is connected; otherwise \(G\) is disconnected. In the system where the processors and their communication links to each other are likely to fail, it is important to consider the fault tolerance of the network. For a connected network \(G = (V, E)\), its inverse problem is that \(G - F\) is disconnected, where \(F \subseteq V\) or \(F \subseteq E\). The connectivity or edge connectivity is the minimum number of \(|F|\). Connectivity plays an important role in measuring the fault tolerance of the network. As a topology structure of interconnection networks, the expanded \(k\)-ary \(n\)-cube \(X Q_n^k\) has many good properties. In this paper, we prove that (1) \(X Q_n^k\) is super edge-connected (\(n \geq 3\)); (2) the restricted edge connectivity of \(X Q_n^k\) is \(8 n - 2\) (\(n \geq 3\)); (3) \(X Q_n^k\) is super restricted edge-connected (\(n \geq 3\)).