Fault-tolerant maximal local-connectivity on Bubble-sort star graphs

An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processor and communication links, respectively. Connectivity is an important measurement for the fault tolerant in interconnection network. Two vertices is maximally local-connected if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vertices. In this paper, we show that an n -dimensional Bubble-sort star graph is ( 2 n - 5 ) -fault-tolerant maximally local-connected and is also ( 2 n - 6 ) -fault-tolerant one-to-many maximally local-connected.

[1]  P. Steerenberg,et al.  Targeting pathophysiological rhythms: prednisone chronotherapy shows sustained efficacy in rheumatoid arthritis. , 2010, Annals of the rheumatic diseases.

[2]  David J. Evans,et al.  On the maximal connected component of a hypercube with faulty vertices III , 2006, Int. J. Comput. Math..

[3]  Sun-Yuan Hsieh,et al.  {2,3}-Extraconnectivities of hypercube-like networks , 2013, J. Comput. Syst. Sci..

[4]  Jianer Chen,et al.  Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults , 2003, J. Interconnect. Networks.

[5]  Jianer Chen,et al.  On strong Menger-connectivity of star graphs , 2003, Discret. Appl. Math..

[6]  Shuming Zhou,et al.  Fault tolerant maximal local connectivity of alternating group networks , 2010, 2010 3rd International Congress on Image and Signal Processing.

[7]  Jang-Ping Sheu,et al.  Bubblesort star graphs: a new interconnection network , 1996, Proceedings of 1996 International Conference on Parallel and Distributed Systems.

[8]  Sun-Yuan Hsieh,et al.  Extraconnectivity of k-ary n-cube networks , 2012, Theor. Comput. Sci..

[9]  David J. Evans,et al.  On the maximal connected component of hypercube with faulty vertices (II) , 2004, Int. J. Comput. Math..

[10]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[11]  Jimmy J. M. Tan,et al.  Maximally Local Connectivity on Augmented Cubes , 2009, ICA3PP.

[12]  Jimmy J. M. Tan,et al.  Strong Menger connectivity with conditional faults on the class of hypercube-like networks , 2008, Inf. Process. Lett..

[13]  John P. Hayes,et al.  Edge fault tolerance in graphs , 1993, Networks.

[14]  Sun-Yuan Hsieh,et al.  Extra edge connectivity of hypercube-like networks , 2013, Int. J. Parallel Emergent Distributed Syst..

[15]  Eddie Cheng,et al.  Linearly many faults in Cayley graphs generated by transposition trees , 2007, Inf. Sci..

[16]  Jimmy J. M. Tan,et al.  Fault-Tolerant Maximal Local-Connectivity on the Bubble-Sort Graphs , 2009, 2009 Sixth International Conference on Information Technology: New Generations.

[17]  Jimmy J. M. Tan,et al.  Local-Connectivity and Maximal Local-Connectivity on the class of Matching Composition Networks , .

[18]  K. Menger.  Zur allgemeinen Kurventheorie , 1927 .