Open AccessThe r-Extra Diagnosability of Hyper Petersen Graphs
Author(s) -
Shiying Wang
Publication year - 2021
Publication title -
international journal of foundations of computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.261
H-Index - 42
eISSN - 1793-6373
pISSN - 0129-0541
DOI - 10.1142/s0129054121500234
Subject(s) - interconnection , computer science , measure (data warehouse) , mathematics , topology (electrical circuits) , combinatorics , discrete mathematics , data mining , computer network
The diagnosability of a multiprocessor system or an interconnection network plays an important role in measuring the fault tolerance of the network. In 2016, Zhang et al. proposed a new measure for fault diagnosis of the system, namely, the [Formula: see text]-extra diagnosability, which restrains that every fault-free component has at least [Formula: see text] fault-free nodes. As a famous topology structure of interconnection networks, the hyper Petersen graph [Formula: see text] has many good properties. It is difficult to prove the [Formula: see text]-extra diagnosability of an interconnection network. In this paper, we show that the [Formula: see text]-extra diagnosability of [Formula: see text] is [Formula: see text] for [Formula: see text] and [Formula: see text] in the PMC model and for [Formula: see text] and [Formula: see text] in the MM[Formula: see text] model.