2 research outputs found
The tightly super 3-extra connectivity and 3-extra diagnosability of crossed cubes
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 -extra diagnosability
of , which restrains that every component of has at least
vertices. As an important variant of the hypercube, the -dimensional crossed
cube has many good properties. In this paper, we prove that
is tightly super 3-extra connected for and the 3-extra
diagnosability of is under the PMC model and MM
model
On the -extra connectivity of graphs
Connectivity and diagnosability are two important parameters for the fault
tolerant of an interconnection network . In 1996, F\`{a}brega and Fiol
proposed the -extra connectivity of . A subset of vertices is said to
be a \emph{cutset} if is not connected. A cutset is called an
\emph{-cutset}, where is a non-negative integer, if every component of
has at least vertices. If has at least one -cutset, the
\emph{-extra connectivity} of , denoted by , is then defined
as the minimum cardinality over all -cutsets of . In this paper, we
first obtain the exact values of -extra connectivity of some special graphs.
Next, we show that for , and graphs with and trees with
are characterized, respectively. In the end, we get the
three extremal results for the -extra connectivity.Comment: 20 pages; 2 figure