Largest connected component of a star graph with faulty vertices

International Journal of Computer Mathematics

Volumn 85, Issue 12, 2008, Pages 1771-1778

  Yang, Xiaofan ^a   Megson, Graham M ^b   Tang, Yuan Yan ^a,c   Xing, Yongkang ^a  

^a CHONGQING UNIVERSITY   (China)

^b UNIVERSITY OF READING   (United Kingdom)

^c HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

Fault tolerance; Interconnection network; Largest connected component; Star graph

Indexed keywords

ADJACENT VERTICES; CONNECTED COMPONENT; FAULT-TOLERANT ABILITIES; FAULTY VERTICES; FUNCTIONAL NETWORK; LARGEST CONNECTED COMPONENT; NEIGHBOURHOOD; STAR GRAPHS;

COMPUTER SCIENCE; FAULT TOLERANCE; MATHEMATICAL TECHNIQUES;

INTERCONNECTION NETWORKS;

EID: 54049090846     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160701619200     Document Type: Article

References (30)

1. S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans. Comp. C-38(4) (1989), pp. 555-566.
2. S.G. Akl, K. Qiu, and I. Stojmenović, Fundamental algorithms for the star and pancake graph interconnection networks with applications to computational geometry, Networks 23(4) (1993), pp. 215-225.
3. A.-E. Al-Ayyoub and K. Day, Matrix decomposition on the star graph, IEEE Trans. Parallel Distrib, Syst. 8(8) (1997), pp. 803-812.
4. _, Vertex-ranking schemes for the star networks, J. Parallel Distrib. Comput. 63(3) (2003), pp. 239-250.
5. A. Bouabdallah, M.C. Heydemann, J. Opatrny et al., Embedding complete binary trees into star and pancake graphs, Theory Comput. Syst. 31(3) (1998), pp. 279-305.
6. R. Chandra and C.S.R. Murthy, A faster algorithm for solving linear algebraic equations on the star graph, J. Parallel Distrib. Comput. 63(4) (2003), pp. 465-480.
7. K. Day and A.-E. Al-Ayyoub, Adaptive fault-tolerant routing in star networks, J. Interconnect. Netw. 2(2) (2001), pp. 213-232.
8. _, Reliable communication in faulty star networks, International Parallel and Distributed Processing Symposium.: IPDPS 2002 Workshops, Marriott Marina, Fort Lauderdale, Florida, USA, 2002, p. 0260b.
9. A.H. Esfahanian, Generalized measures of fault tolerance with application to N-cube networks, IEEE Trans. Comp. 38(11) (1989), pp. 1586-1591.
10. P. Fragopoulou and S.G. Akl, A parallel algorithm for computing Fourier transforms on the star graph, IEEE Trans. Parallel Distrib. Syst. 5(5) (1994), pp. 525-531.
11. P. Fragopoulou and S.G. Akl, Fault tolerant communication algorithms on the star network using disjoint paths. 28th Annual Hawaii International Conference on System Sciences, Kihei, Maui, Hawaii, USA, Vol. 2 1995, pp. 4-13.
12. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
13. S.Y. Hsieh, G.H. Chen, and C.W. Ho, Longest fault-free paths in star graphs with vertex faults, Theor. Comp. Sci. 262(1-2) (2001), pp. 215-227.
14. _, Longest fault-free paths in star graphs with edge faults, IEEE Trans. Comp. 50(9) (2001), pp. 960-971.
15. S. Latifi and N. Bagherzadeh, On embedding rings into a star-related network, Inf. Comp. Sci. 99(1-2) (1997), pp. 21-35.
16. S. Latifi, N. Bagherzadeh, and R.R. Gajjala, Fault-tolerant embedding of linear arroy s and rings in the star graph, Comp. Electr. Eng. 23(2) (1997), pp. 95-107.
17. T.K. Li, Cycle embedding in star graphs with edge faults, Appl. Math. Comput. 167(2) (2005), pp. 891-900.
18. N. Nassif and N. Bagherzadeh, A grid embedding into the star graph for image analysis solutions, Inf. Process. Lett. 60(5) (1996), pp. 255-260.
19. B. Parhami, An Introduction to Parallel Processing: Algorithms and Architectures, Plenum. Press, 1999.
20. K. Qiu and S.G. Akl, On vertex-to-vertex disjoint paths in the star interconnection network. International Conference on Parallel and Distributed Computing Systems, PDCS 2005, Phoenix, AZ, USA. 2005, pp. 731-735.
21. S. Rajasekaran and D.S.L. Wei, Selection, routing, and sorting on the star graph, J. Parallel Distrib. Comput. 41(2) (1997), pp. 225-233.
22. S. Ranka, J.C. Wang, and N. Yeh, Embedding meshes on the star graph, J. Parallel Distrib. Comput. 19(2) (1993), pp. 131-135.
23. D.K. Saikia, R. Badrinath, and R.K. Sen, Embedding torus on the star graph, IEEE Trans. Parallel Distrib. Syst. 9(7) (1998), pp. 650-663.
24. H. Sarbazi-Azad, M. Ould-Khaoua, L.M. Mackenzie et a!., A parallel algorithm for Lagrange interpolation on the star graph, J. Parallel Distrib. Comput. 62(4) (2002), pp. 605-621.
25. S.B. Tien and C.S. Raghavendra, Algorithms and bounds for shortest paths and diameter in faulty hypercubes, IEEE Trans. Parallel Distrib. Syst. 4(6) (1993), pp. 713-718.
26. Y.C. Tseng, S.H. Chang, and J.P. Sheu, Fault-tolerant ring embedding in a star graph with both link and vertex failures, IEEE Trans. Parallel Distrib. Syst. 8(12) (1997), pp. 1185-1195.
27. X. Yang and Y.Y. Tang, A (4n - 9)/3 diagnosis algorithm for hypercube networks, Inf. Sci. 177(8) (2007), pp. 1771-1781.
28. X. Yang, D.J. Evans, B. Chen et al., On the maximal connected component of hypercube with faulty vertices, Int. J. Comp. Math. 81(5) (2004), pp. 515-525.
29. X. Yang, D.J. Evans, and G.M. Megson, On the maximal connected component of hypercube with faulty vertices II, Int. J. Comp. Math. 81(10) (2004), pp. 1175-1185.
30. _, On the maximal connected component of hypercube with faulty vertices III, Int. J. Comp. Math. 83(1) (2006), pp. 27-37.