Cyclic connectivity of the data center network

Abstract

Let G be a connected graph, F be a subset of , S be a subset of . The cyclic vertex connectivity of G, denoted by , is the minimum cardinality of F such that G−F is disconnected and at least two of its components contain cycles. The cyclic edge connectivity of G, denoted by , is the minimum cardinality of S such that G−S is disconnected and at least two of its components contain cycles. Let denote the data center network. In this paper, we obtain the following results: for ; for , ; for ; for ; for , .