The component (edge) connectivity of shuffle-cubes

Abstract Component (edge) connectivity is a generalization of traditional (edge) connectivity. Let F be a vertex set (resp., an edge set), if G − F has at least g components, F is a g-component (edge) cut. The g-component (edge) connectivity of graph G is the minimum size of the g-component (edge) cut. In this paper, we study the g-component (edge) connectivity of shuffle-cubes for small g.