Pk and Ck structure and substructure connectivity of hypercubes
Abstract
Hypercube is one of the most important networks to interconnect processors in multiprocessor computer systems. Different kinds of connectivities are important parameters to measure the fault tolerability of networks. Lin et al.LinStructure introduced the concept of H-structure connectivity (Qn;H) (resp. H-substructure connectivity s(Qn;H)) as the minimum cardinality of F=\H1,…,Hm\ such that Hi (i=1,…,m) is isomorphic to H (resp. F=\H'1,…,H'm\ such that H'i (i=1,…,m) is isomorphic to connected subgraphs of H) such that Qn-V(F) is disconnected or trivial. In this paper, we discuss (Qn;H) and s(Qn;H) for hypercubes Qn with n≥ 3 and H∈ \Pk,Ck|3≤ k≤ 2n-1\. As a by-product, we solve the problem mentioned in ManeStructure.
0