Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes

Abstract

Let G be a connected graph and S⊆V(G) with |S|≥2. A tree T in G is called an S-tree if S⊆V(T). Two S-trees T1 and T2 are internally disjoint if E(T1)∩E(T2)=∅ and V(T1)∩V(T2)=S. For an integer r≥2, the generalized r-connectivity of a graph G, denoted by κr(G), is defined as κr(G)=min{κG(S)|S⊆V(G) and |S|=r}, where κG(S) denotes the maximum number of pairwise internally disjoint S-trees in G. The folded divide-and-swap cube, denoted by FDSCn, is a variant of the hypercube. FDSCn has better network cost measured by the product of degree and diameter than the hypercube and folded hypercube. Connectivity and super connectivity are two important parameters to evaluate the reliability of an interconnection network. In addition, as a generalization of traditional connectivity, generalized connectivity can more accurately assess the reliability of an interconnection network. In this paper, we first acquire the (edge) connectivity and super (edge) connectivity of FDSCn and then obtain the generalized 3-connectivity of FDSCn.