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 , .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Parallel, Emergent and Distributed Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
