The Tightly Super 2-good-neighbor connectivity and 2-good-neighbor Diagnosability of Crossed Cubes
Shiying Wang, Xiaolei Ma, Yunxia Ren · International Journal of New Technology and Research · 2017
The reliability of an interconnection network is an important issue for multiprocessor systems. We know that connectivity and the diagnosability are two important parameters for measuring the reliability of an interconnection network. In 2012, Peng et al. proposed the g-good-neighbor diagnosability, which has been widely accepted as a new measure of the diagnosability by restricting that every fault-free vertex contains at least gnbspfault-free neighbors. As an important variant of the hypercube, the n-dimensional crossed cube CQnnbsphas many good properties. In this paper, we show that (1) the 2-good-neighbor connectivity of nbspCQnnbspis 4n-8nbspfor nge4, (2) CQnnbspis tightly (4n-8)nbspsuper 2-good-neighbor connected for nge6nbspand (3) the 2-good-neighbor diagnosability of nbspCQnnbspis 4n-5nbspunder the PMC model and MM* model for nge4nbsp.