Super connectivity of folded twisted crossed cubes (Q2235251)

The authors 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, the authors show that the connectivity and the edge connectivity of \(FTCQ_n\) are \(n+1\) for \(n\geq 4\). Moreover, they show that the super-connectivity and the super-edge-connectivity of \(FTCQ_n\) are \(2n\) for \(n\geq 4\).