Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 83, 2006 - Issue 1
Submit an article Journal homepage
168
Views
79
CrossRef citations to date
0
Altmetric
Original Articles

On the maximal connected component of a hypercube with faulty vertices III

Xiaofan Yang College of Computer Science, Chongqing University, Chongqing, 400044, P.R. ChinaCorrespondence[email protected] [email protected]
,
David J. Evans Parallelism, Algorithms and Architectures Research Centre, Department of Computer Science, Loughborough University, Loughborough, Leics, LE11 3TU, UK
&
Graham M. Megson Department of Computer Science, School of Systems Engineering, University of Reading, PO Box 225, Whiteknights, Reading, Berks, RG6 6AY, UK
Pages 27-37 | Received 29 Nov 2004, Published online: 25 Jan 2007
 
Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

Abstract

Hypercube is one of the most popular topologies for connecting processors in multicomputer systems. In this paper we address the maximum order of a connected component in a faulty cube. The results established include several known conclusions as special cases. We conclude that the hypercube structure is resilient as it includes a large connected component in the presence of large number of faulty vertices.

Acknowledgements

This work was supported by the Natural Science Funds of China (60271019) and Natural Science Funds of Chongqing (# CSTC, 2005BB2191).

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related Research Data

GRAPH THEORY
Source: Defense Technical Information Center
Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
Source: World Scientific Pub Co Pte Lt
Diagnosability problems of the exchanged hypercube and its generalization
Source: Informa UK Limited
Linearly many faults in arrangement graphs
Source: Wiley
On the maximal connected component of hypercube with faulty vertices (II)
Source: Informa UK Limited
On diagnosability of large fault sets in regular topology-based computer systems
Source: Institute of Electrical and Electronics Engineers (IEEE)
Generalized measures of fault tolerance with application to N-cube networks
Source: Institute of Electrical and Electronics Engineers (IEEE)
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
Source: Wiley
LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
Source: World Scientific Pub Co Pte Lt
Fault Diagnosis in a Boolean n Cube Array of Microprocessors
Source: Institute of Electrical and Electronics Engineers (IEEE)
Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults
Source: World Scientific Pub Co Pte Lt
On the maximal connected component of hypercube with faulty vertices
Source: (:unav)

Linking provided by 

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.