Link fault tolerability of the Cartesian product power graph $$(K_{9}-C_{9})^{n}$$ : conditional edge-connectivities under six link fault patterns

Abstract

High-performance computing extensively depends on parallel and distributed systems, necessitating the establishment of quantitative parameters to evaluate the fault tolerability of interconnection networks. The topological structures of interconnection networks in some parallel and distributed systems are designed as n-dimensional \((K_{9}-C_{9})^{n}\), obtained through the repeatedly application of the n-th Cartesian product operation. Since the \(\mathcal {P}\)-conditional edge-connectivity is proposed by Harary, as a parameter for evaluating the link fault tolerability of the underlying topology graph of the interconnection network system, it has been widely studied in many interconnection networks. The \(\mathcal {P}\)-conditional edge-connectivity of a connected graph G, denoted by \(\lambda (\mathcal {P};G)\), if any, describes the minimum cardinality of the fault edge-cut of the graph G, whose malfunction divides G into multiple components, with each component satisfying a given property \(\mathcal {P}\) of the graph. In this paper, we primarily define \(\mathcal {P}_{i}^{t}\) to be properties of containing at least \(9^t\) processors, every remaining processor lying in a lower dimensional subnetwork of the \((K_{9}-C_{9})^{n}\), \((K_{9}-C_{9})^{t}\), having a minimum degree or average degree of at least 6t, existing two components with each component having at least \(9^t\) processors, and containing at least one cycle, respectively. We use the properties of the optimal solution to the edge isoperimetric problem of \((K_{9}-C_{9})^{n}\) and find that the exact values of the \(\mathcal {P}_{i}\)-conditional edge-connectivities of the graph \((K_{9}-C_{9})^{n}\) share a common value of \(6(n-t)9^t\) for \(1\le i\le 5\) and \(0\le t\le n-1\), except for \(i=6\), the value is \(18n - 6\).