The connectivity is an important parameter to evaluate the robustness of a network. As a generalization, structure connectivity and substructure connectivity of graphs were proposed. For connected graphs and , the -structure connectivity (resp. -substructure connectivity ) of is the minimum cardinality of a set of subgraphs of that each is isomorphic to (resp. to a connected subgraph of ) so that is disconnected or the singleton. As popular variants of hypercubes, the -dimensional folded hypercubes and augmented cubes are attractive interconnected network prototypes for multiple processor systems. In this paper, we obtain that for , , and for .

生成讲解博客的中文版本

生成AI智能校验的中文版本