Largest connected component of a star graph with faulty vertices

References

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