Abstract
The t-embedded edge connectivity ηt(Gn) of an n-dimensional recursive network Gn is the minimum number of edges, if any, whose removal disconnects Gn and each vertex of the resultant network lies in a t-dimensional subnetwork of Gn. The k-ary n-cube is one of the most attractive interconnection networks for parallel computer systems. One of the main results in [15] showed that ηt(Qn3)=2(n−t)3t for 0≤t≤n−1. In this short paper, we generalize the above result and prove that ηt(Qnk)=2(n−t)kt for 0≤t≤n−1 and odd k≥3.
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 callDisclaimer: 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.
