Super connectivity of folded twisted crossed cubes

We introduce a new kind of network called folded twisted crossed cube FTCQ(n), which is obtained from the twisted crossed cube TCQ(n) by adding extra 2(n-1) edges. The super-connectivity (resp. super-edge-connectivity) of a connected graph G is the minimum number of vertices (resp. edges) whose deletion disconnects G without creating isolated vertices. In this paper, we show that the connectivity and the edge connectivity of FTCQ(n) are n + 1 for n >= 4. We also determine that the super-connectivity and the super-edge-connectivity of FTCQn are 2n for n >= 4. (C) 2021 Elsevier B.V. All rights reserved.