Abstract

Let Gn be an n-dimensional recursive network. A set F⊂V(Gn) (resp. F⊂E(Gn)) is called a t-embedded vertex cut (resp. t-embedded edge cut) of Gn if Gn−F is disconnected and each vertex of which lies in a t-dimensional subnetwork of Gn−F. The t-embedded vertex connectivity ζt(Gn) (resp. t-embedded edge connectivity ηt(Gn)) of Gn is the minimum cardinality over all t-embedded vertex cuts (resp. t-embedded edge cuts) in Gn, if any. In this paper, we prove that ζt(Qn3)=2(n−t)3t for 0≤t≤n−2, and ηt(Qn3)=2(n−t)3t for 0≤t≤n−1, where Qn3 is the ternary n-cube.

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 call

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.