Largest connected component of a star graph with faulty vertices

  • Authors:

  • Xiaofan Yang;Graham M. Megson;Yuan Yan Tang;Yongkang Xing

  • Affiliations:

  • College of Computer Science, Chongqing University, Chongqing, P.R. China;Department of Computer Science, School of Systems Engineering, University of Reading, Reading, Berkshire, UK;College of Computer Science, Chongqing University, Chongqing, P.R. China,Department of Computer Science, Hong Kong Baptist University, Kowloon, Hong Kong;College of Computer Science, Chongqing University, Chongqing, P.R. China

  • Venue:
  • International Journal of Computer Mathematics
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In order to make a full evaluation of an interconnection network, it is essential to estimate the minimum size of a largest connected component of this network provided the faulty vertices in the network may break its connectedness. Star graphs are recognized as promising candidates for interconnection networks. This article addresses the size of a largest connected component of a faulty star graph. We prove that, in an n-star graph (n≥3) with up to 2n-4 faulty vertices, all fault-free vertices but at most two form a connected component. Moreover, all fault-free vertices but exactly two form a connected component if and only if the set of all faulty vertices is equal to the neighbourhood of a pair of fault-free adjacent vertices. These results show that star graphs exhibit excellent fault-tolerant abilities in the sense that there exists a large functional network in a faulty star graph.