Wang, M., Guo, Y. and Wang, S. (2015) The 1-Good-Neighbor Diagnosability of Cayley Graphs Generated by Transposition Trees under the PMC Model and MM* Model. International Journal of Computer Mathematics, 1-12.
http://dx.doi.org/10.1080/00207160.2015.1119817

has been cited by the following article:

• TITLE: Some Properties of the g-Good-Neighbor (g-Extra) Diagnosability of a Multiprocessor System

  AUTHORS: Yunxia Ren, Shiying Wang

  KEYWORDS: Interconnection Network, Combinatorics, Diagnosability

  JOURNAL NAME: American Journal of Computational Mathematics, Vol.6 No.3, September 21, 2016

  ABSTRACT: Diagnosability of a multiprocessor system is one important study topic. In 2012, Peng et al. proposed a measure for fault tolerance of the system, which is called the g-good-neighbor diagnosability that restrains every fault-free node containing at least g fault-free neighbors. In 2015, Zhang et al. proposed a measure for fault diagnosis of the system, namely, g-extra diagnosability, which restrains that every fault-free component has at least g+1 fault-free nodes. In this paper, we obtain some properties of the g-good-neighbor (g-extra) diagnosability of the system and give the g-good-neighbor (g-extra) diagnosability of some graphs under the PMC model and MM* model.