Fault tolerant maximal local connectivity of alternating group networks

The growing size of a multiprocessor system increases its vulnerability to component failures, and the minimum size of a largest connected component in such a networked system is typically used as a measure for fault tolerance of the system. A graph is maximally local connected if the maximum number of internally vertex disjoint paths between any two vertices is the minimum degree of these two vertices. This paper shows that the maximal local connectivity of survival Alternating group network AN_n is achieved by evaluating the size of maximum connected component of the survival graph of AN_n when a lot of faulty vertices occur.