Name
Title | ||
|---|---|---|
Equal relation between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM∗ model of a graph |
Abstract | ||
|---|---|---|
Diagnosability has played an important role in reliability of an interconnection network. In 2012, Peng et al. proposed a new measure of diagnosability, namely, g-good-neighbor diagnosability, which requires every fault-free vertex has at least g fault-free neighbors. The PMC model and MM∗ model are widely adopted as the fault diagnosis model. The problems of g-good-neighbor diagnosability of many well-known networks under the PMC model and MM∗ model have been widely explored. In this paper, we study the relationship between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM∗ model of a graph G. In addition, we give some sufficient conditions to ascertain g-good-neighbor diagnosability of a graph G under the PMC model and MM∗ model. From this, many previous results can be directly obtained and g-good-neighbor diagnosability for many well-known networks under the PMC model and MM∗ model, are derived. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.dam.2019.02.021 | Discrete Applied Mathematics |
Keywords | Field | DocType |
g-good-neighbor diagnosability,g-good-neighbor connectivity,PMC model,MM∗ model | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Interconnection,Mathematics | Journal |
Volume | ISSN | Citations |
262 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaomin Hu | 1 | 3 | 2.09 |
| Weihua Yang | 2 | 11 | 3.88 |
| Yingzhi Tian | 3 | 2 | 1.04 |
| Jixiang Meng | 4 | 353 | 55.62 |