123
Views
68
CrossRef citations to date
0
Altmetric
Original Articles

On the maximal connected component of hypercube with faulty vertices

, , , &
Pages 515-525 | Accepted 12 Nov 2003, Published online: 12 May 2010
 

Abstract

In evaluating an interconnection network, it is indispensable to estimate the size of the maximal connected components of the underlying graph when the network begins to lose processors. Hypercube is one of the most popular interconnection networks. This article addresses the maximal connected components of an n-dimensional cube with faulty processors. We first prove that an n-cube with a set F of at most 2n − 3 failing processors has a component of size ≥2 n  − |F| − 1. We then prove that an n-cube with a set F of at most 3n − 6 missing processors has a component of size ≥2 n  − |F| − 2.

Acknowledgements

This research was partly supported by the Visiting Scholar's Funds of National Education Ministry's Key Laboratory of Electro-Optical Technique and System, Chongqing University.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.