The h-faulty-block connectivity of k-ary n-cubes

The connectivity of a network is an important indicator for assessing its reliability and fault tolerability. However, currently various kinds of connectivity do not well reflect the network’s fault tolerance when facing certain attacks such as Botnet attacks, DDoS attacks, and Local Area Network Denial attacks. Therefore, Lin et al. (A novel measurement for network reliability. IEEE Trans Comput 2021; 70: 17191731.) proposed a new measurement for network reliability. This measurement method can resist the block attack by taking into account of the dispersity of the remaining nodes. Let G be a network, C ⊂ V(G), and $G[C]$ be a connected subgraph. Then C is called an h-faulty-block of G if $G-C$ is disconnected, and every component of $G-C$ has at least $h+1$ nodes. The minimum cardinality over all h-faulty-block of G is called h-faulty-block connectivity, denoted by FB_kₕ(G). In this paper, we determine FB_kₕ(Qₙᵏ) for k-ary n-cube Qₙᵏ (k≥ 3), a classic interconnection network. We prove that FB_k₀(Qₙ³)=3n-1, FB_k₁(Qₙ³)=5n-4, and FB_k₂(Qₙ³)=7n-9 for n≥ 3. Also, we show that FB_k₀(Qₙᵏ)=4n-1 for k≥ 4 and n≥ 2, FB_k₁(Qₙ⁴)=6n-4 for n≥ 3, FB_k₁(Qₙᵏ)=6n-3 for k≥ 5 and n≥ 3, FB_k₂(Qₙ⁴)=8n-7 for n≥ 4, FB_k₂(Qₙ⁵)=8n-6 for n≥ 4, and FB_k₂(Qₙᵏ)=8n-5 for k≥ 6 and n≥ 5.