Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1708.01703 v1 pith:QIEF7U22 submitted 2017-08-05 cs.IT math.IT

The tightly super 3-extra connectivity and 3-extra diagnosability of crossed cubes

classification cs.IT math.IT
keywords extradiagnosabilitycrossedinterconnectionlinksmanymodelprocessors
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. 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 $CQ_{n}$ has many good properties. In this paper, we prove that $CQ_{n}$ is tightly $(4n-9)$ super 3-extra connected for $n\geq 7$ and the 3-extra diagnosability of $CQ_{n}$ is $4n-6$ under the PMC model $(n\geq5)$ and MM$^*$ model $(n\geq7)$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.