A Note on the Connectivity of m-Ary n-Dimensional Hypercubes
Abstract
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 has many good properties. In this paper, we prove, by elementary method, that is tightly super connected and super edge-connected .
References
- 1. , Graph Theory (Springer, New York, 2008). Crossref, Google Scholar
- 2. , On super restricted edge-connectivity of edge-transitive graphs, Discrete Mathematics 310 (2010) 2273–2279. Crossref, ISI, Google Scholar
- 3. , Fault tolerance measures for m-ary n-dimensional hypercubes based in forbidden faulty sets, IEEE Transactions on Computers 47 (1998) 888–893. Crossref, ISI, Google Scholar
- 4. , On super 2-restricted and 3-restricted edge-connected vertex transitive graphs, Discrete Mathematics 311 (2011) 2683–2689. Crossref, ISI, Google Scholar


