WestminsterResearch will not be accepting deposits until 16th March 2015. This is to allow for a system upgrade and server migration.

Largest connected component of a star graph with faulty vertices

Yang, Xiaofan and Megson, Graham M. and Tang, Yuan Yan and Xing, Yongkang (2008) Largest connected component of a star graph with faulty vertices. International Journal of Computer Mathematics, 85 (12). pp. 1771-1778. ISSN 0020-7160

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1080/00207160701619200


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.

Item Type:Article
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:5762
Deposited On:30 Jan 2009 09:42
Last Modified:20 Oct 2009 14:48

Repository Staff Only: item control page