The pessimistic diagnosability of alternating group graphs under the PMC model

The process of identifying faulty processors is called the diagnosis of the system. Several diagnostic models have been proposed, the most popular is the PMC (Preparata, Metze and Chen) diagnostic model. The pessimistic diagnosis strategy is a classic strategy based on the PMC model in which isolates all faulty nodes within a set containing at most one fault-free node. A system is t/t-diagnosable if, provided the number of faulty processors is bounded by t, all faulty processors can be isolated within a set of size at most t with at most one fault-free node mistaken as a faulty one. The pessimistic diagnosability of a system G, denoted by tp(G), is the maximal number of faulty processors so that the system G is t/t-diagnosable. Jwo et al. [11] introduced the alternating group graph as an interconnection network topology for computing systems. The proposed graph has many advantages over hypercubes and star graphs. For example, for all alternating group graphs, every pair of vertices in the graph are connected by a Hamiltonian path and the graph can embed cycles with arbitrary length with dilation 1. In this article, we completely determine the pessimistic diagnosability of an n-dimensional alternating group graph, denoted by AGn. Furthermore, tp(AGn)=4n−11 for n≥4. •The pessimistic diagnosability of popular interconnection networks is studied.•Alternation group graph is shown to have the strong diagnosability property.•The pessimistic diagnosability of an n-dimensional alternating group graph is determined.