 The 2-good-neighbor (2-extra) diagnosability of alternating group graph networks under the PMC model and MM* modelShiying Wang and Yuxing Yang Applied Mathematics and Computation, 2017, vol. 305, issue C, 241-250 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 2016, Zhang et al. proposed a new measure for fault diagnosis of the system, namely, the g-extra diagnosability, which restrains that every fault-free component has at least (g+1) fault-free nodes. As a favorable topology structure of interconnection networks, the n-dimensional alternating group graph network ANn has many good properties. In this paper, we obtain that (a) the 2-good-neighbor diagnosability of ANn is 3n−7 for n ≥ 4 under the PMC model and MM* model; (b) the 2-extra diagnosability of ANn is 3n−7 for n ≥ 4 under the PMC model, and the 2-extra diagnosability of ANn is 3n−7 for n ≥ 5 under the MM* model. These results are optimal with respect to 2-extra diagnosability of ANn. Keywords: Interconnection network; Combinatorics; Diagnosability; Connectivity; Alternating group graph network (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:305:y:2017:i:c:p:241-250 DOI: 10.1016/j.amc.2017.02.006 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.