<i>g</i>-Good-Neighbor Diagnosability of Arrangement Graphs under the PMC Model and MM* Model
Diagnosability of a multiprocessor system is an important research topic. The system and interconnection network has a underlying topology, which usually presented by a graph <inline-formula> <math display="inline"> <semantics> <mrow> <mi>G</mi> <mo&g...
Main Authors: | Shiying Wang, Yunxia Ren |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-11-01
|
Series: | Information |
Subjects: | |
Online Access: | https://www.mdpi.com/2078-2489/9/11/275 |
Similar Items
-
The g-Good-Neighbor Diagnosability of Bubble-Sort Graphs under Preparata, Metze, and Chien’s (PMC) Model and Maeng and Malek’s (MM)* Model
by: Shiying Wang, et al.
Published: (2019-01-01) -
The 2-good-neighbour diagnosability of modified bubble-sort graphs under the PMC and MM* model
by: Yanling Wang, et al.
Published: (2020-01-01) -
Fault diagnosability of regular graphs
by: Mei-Mei Gu, et al.
Published: (2020-12-01) -
(t,k)-diagnosability of exchanged crossed cube under the PMC model
by: Chen GUO, et al.
Published: (2019-06-01) -
(t,k)-diagnosability of exchanged crossed cube under the PMC model
by: Chen GUO, et al.
Published: (2019-06-01)