The structure fault tolerance of burnt pancake networks

One of the symbolic parameters to measure the fault tolerance of a network is its connectivity. The H-structure connectivity and H-substructure connectivity extend the classical connectivity and are more practical. For a graph G and its connected subgraph H, the H-structure connectivity kappa(s)(G ; H) (resp. H-substructure connectivity kappa (G; H) s ) of G is the cardinality of a minimum subgraph set such that every element of the set is isomorphic to H (resp. every element of the set is isomorphic to a connected subgraph of H) in G, whose vertices removal disconnects G. In this article, we investigate the H-structure connectivity and H-substructure connectivity of the n-dimensional burnt pancake network BPn for each { H is an element of K-1, K-1,K-1, ...,K-1, (n-1), P-4, ...,P-7, C-8}.