Super Connectivity and Diagnosability of Crossed Cubes

Super Connectivity and Diagnosability of Crossed Cubes

A multiprocessor system and an interconnection network have a underlying topology, which usually presented by a graphG . In 2016, Zhang et al. proposed the g -extra diagnosability of G , which restrains that every component of G − S has at least (g +1) vertices. As an important variant of the hypercube, the n - dimensional crossed cube CQn has many good properties. In this paper, we prove that CQn is tightly (4n−9)super 3-extra connected for n ≥ 7 and the 3-extra diagnosability of CQn  is 4n−6  under the PMC model (n ≥ 5) and MM * model (n ≥ 7) .