.png){kind=icon}
.png){kind=icon}
Return
The cyclic diagnosability of (n,k) -bubble-sort network and (n,k)-star network
.png){kind=icon}
PRE
AI
G
C
W
DOI：10.1080/02533839.2026.2626277.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A vertex subset D of a graph G is a cyclic faulty set if G-D is disconnected and G-D has at least two components containing cycles. The cyclic diagnosability of a graph G is the maximum size of cyclic faulty sets of G that can be identified. This paper focuses on the cyclic diagnosability of two kinds of graphs containing complete graphs: (n,k)-bubble-sort network B-n,B-k and (n,k)-star network S-n,S-k. We obtain that the cyclic diagnosability of B-n,B-k (resp. S-n,S-k) is n+5k-9 under both PMC and MM & lowast; models, where n >= 16 and 5 <= k <= n-1/3 (resp. n >= 13 and 5 <= k <= n+2/3). In addition, we compare the cyclic diagnosability of B-n,B-k with its other types of diagnosability. Moreover, we give the algorithm for cyclic fault diagnosis under PMC model.
Keywords:
Cyclic diagnosability
PMC model
MM* model
Cyclic diagnosability
n, k & eth
& THORN
- bubble-sort network
n, k & eth
& THORN
- star network
PMC model
MM* model
Journal
J
IF:
1.2
Papers:
122
Citations:
1.1K
Organization
Cited Papers