World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

A Note on the Connectivity of m-Ary n-Dimensional Hypercubes

    Connectivity plays an important role in measuring the fault tolerance of interconnection networks. As a topology structure of interconnection networks, the m-ary n-dimensional hypercube HCnm has many good properties. In this paper, we prove, by elementary method, that HCnm is tightly n(m1) super connected (n2) and super edge-connected (n3).

    References

    • 1. J. A. Bondy and U. S. R. Murty, Graph Theory (Springer, New York, 2008). CrossrefGoogle Scholar
    • 2. Y. Tian and J. Meng, On super restricted edge-connectivity of edge-transitive graphs, Discrete Mathematics 310 (2010) 2273–2279. Crossref, ISIGoogle Scholar
    • 3. J. Wu and G. Guo, Fault tolerance measures for m-ary n-dimensional hypercubes based in forbidden faulty sets, IEEE Transactions on Computers 47 (1998) 888–893. Crossref, ISIGoogle Scholar
    • 4. W. Yang et al., On super 2-restricted and 3-restricted edge-connected vertex transitive graphs, Discrete Mathematics 311 (2011) 2683–2689. Crossref, ISIGoogle Scholar