The 2-Good 3-Component Connectivity of Alternating Group Networks

Reliability analysis is important for the design of large multiprocessor systems. The connectivity of a graph is an important parameter for assessing the reliability of interconnection networks. For a connected graph [Formula: see text] and [Formula: see text], if [Formula: see text] is disconnected and there exist at least [Formula: see text] components and each vertex [Formula: see text] has at least [Formula: see text] neighbors, then [Formula: see text] is called a [Formula: see text]-good [Formula: see text]-component cut of [Formula: see text]. The [Formula: see text]-good [Formula: see text]-component connectivity of [Formula: see text], denoted by [Formula: see text], is the minimum cardinality of [Formula: see text]-good [Formula: see text]-component cuts of [Formula: see text]. In this paper, we determine the [Formula: see text]-good [Formula: see text]-component connectivity of [Formula: see text]-dimensional alternating group networks [Formula: see text], that is [Formula: see text] for [Formula: see text].