
Data Analytics for the 3-extra Diagnosability of Bubble-sort Star Graphs
Author(s) -
Jingbo Zhao,
Shiying Wang
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1813/1/012028
Subject(s) - sort , graph , computer science , star (game theory) , topology (electrical circuits) , mathematics , combinatorics , theoretical computer science , database , mathematical analysis
The underlying topology of a large processor system is usually represented by a graph. The g -extra diagnosability of graph G requires that each fault-free component has at least ( g + 1) fault-free vertices. It is difficult to prove this problem. The n -dimensional bubble-sort star graph BS has many excellent properties. We show that the 3 -extra diagnosability of BS n is 8 n − 20 under PMC and MM model for n ≥ 5 and n ≥12, respectively.