Generalized fault tolerance properties of star graphs
Recently an attractive interconnection topology has been proposed which compares very favorably with the well known n-cubes in terms of degree, diameter, fault tolerance and resilience. In this paper we investigate further fault tolerance properties of star graphs using the generalized measure of fault tolerance as introduced recently to study n-cubes. Star graphs are found again to compare favorably with n-cubes even using this generalized measure of fault tolerance.
Unable to display preview. Download preview PDF.
- S. B. Akers and B. Krishnamurthy, " A group theoretic model for symmetric interconnection networks", Proceedings of Intl. Conf. on Parallel Processing, pp. 216–213, 1986.Google Scholar
- S. B. Akers, D. Harel and B. Krishnamurthy, " The star graph: an attractive alternative to the n-cube", Proceedings of Intl. Conf. on Parallel Processing, pp. 393–400, 1987.Google Scholar
- S. B. Akers and B. Krishnamurthy, "The fault tolerance of star graphs", Proceedings of 2nd Intl. Conf. on Supercomputing, 1987.Google Scholar
- M. S. Krishnamurthy and B. Krishnamurthy, "Fault diameter of interconnection networks", Journal of Comput. Math. Appl., Vol. 13, pp. 577–582, 1987.Google Scholar
- A.-H. Esfahanian, "Generalized measures of fault tolerance with application of N-cube networks", IEEE Trans. Comput., Vol. 38, pp. 1586–1591, Nov. 1989.Google Scholar
- F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1972.Google Scholar