An Analysis on the Reliability of the Alternating Group Graph

For interconnection network losing processors, usually, when the surviving network has a large connected component, it can be used as a functional subsystem without leading to severe performance degradation. Consequently, it is crucial to characterize the interprocessor communication ability and efficiency of the surviving structure. In this article, we prove that when a subset <inline-formula><tex-math notation="LaTeX">$D$</tex-math></inline-formula> of at most <inline-formula><tex-math notation="LaTeX">$6n-17$</tex-math></inline-formula> processors is deleted from an <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula>-dimensional alternating group graph <inline-formula><tex-math notation="LaTeX">$\text{AG}_n$</tex-math></inline-formula>, there exists a largest component with cardinality greater or equal to <inline-formula><tex-math notation="LaTeX">$|V(\text{AG}_n)|-|D|-3$</tex-math></inline-formula> for <inline-formula><tex-math notation="LaTeX">$n\geq 6$</tex-math></inline-formula> in the remaining network, and the union of small components is, first, an empty graph; or, second, a 3-cycle, or an edge, or a 2-path, or a singleton; or, third, an edge and a singleton, or two singletons. Then, we prove that when a subset <inline-formula><tex-math notation="LaTeX">$D$</tex-math></inline-formula> of at most <inline-formula><tex-math notation="LaTeX">$8n-25$</tex-math></inline-formula> processors is deleted from <inline-formula><tex-math notation="LaTeX">$\text{AG}_n$</tex-math></inline-formula>, there exists a largest component with cardinality greater or equal to <inline-formula><tex-math notation="LaTeX">$|V(\text{AG}_n)|-|D|-5$</tex-math></inline-formula> for <inline-formula><tex-math notation="LaTeX">$n\geq 6$</tex-math></inline-formula> in the remaining network, and the union of small components is, first, an empty graph; or, second, a 5-cycle, or a 4-path, or a 4-claw, or a 4-cycle, or a 3-path, or a 3-claw, or a 3-cycle, or a 2-path, or an edge, or a singleton; or, third, a 4-cycle and a singleton, or a 3-path and a singleton, or a 3-claw and a singleton, or a 2-path and a singleton, two edges, an edge and a singleton, or two singletons; or, fourth, two edges and a singleton, or a 2-path and two singletons, or an edge and two singletons, or three singletons.