Accessibility navigation


Largest connected component of a star graph with faulty vertices

Yang, X.F., Megson, G.M., Tang, Y.Y. and Xing, Y.K. (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 archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1080/00207160701619200

Abstract/Summary

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
Refereed:Yes
Divisions:Faculty of Science
ID Code:15483
Uncontrolled Keywords:interconnection network, fault tolerance, largest connected component, star graph, INTERCONNECTION NETWORKS, PARALLEL ALGORITHM, FREE PATHS, HYPERCUBE, RINGS

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation