5 research outputs found
3-extra connectivity of 3-ary n-cube networks
Let G be a connected graph and S be a set of vertices. The h-extra
connectivity of G is the cardinality of a minimum set S such that G-S is
disconnected and each component of G-S has at least h+1 vertices. The h-extra
connectivity is an important parameter to measure the reliability and fault
tolerance ability of large interconnection networks. The h-extra connectivity
for h=1,2 of k-ary n-cube are gotten by Hsieh et al. in [Theoretical Computer
Science, 443 (2012) 63-69] for k>=4 and Zhu et al. in [Theory of Computing
Systems, arxiv.org/pdf/1105.0991v1 [cs.DM] 5 May 2011] for k=3. In this paper,
we show that the h-extra connectivity of the 3-ary n-cube networks for h=3 is
equal to 8n-12, where n>=3.Comment: 20 pages,1 figures. arXiv admin note: substantial text overlap with
arXiv:1309.496
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
Relationship between Conditional Diagnosability and 2-extra Connectivity of Symmetric Graphs
The conditional diagnosability and the 2-extra connectivity are two important
parameters to measure ability of diagnosing faulty processors and
fault-tolerance in a multiprocessor system. The conditional diagnosability
of is the maximum number for which is conditionally
-diagnosable under the comparison model, while the 2-extra connectivity
of a graph is the minimum number for which there is a
vertex-cut with such that every component of has at least
vertices. A quite natural problem is what is the relationship between the
maximum and the minimum problem? This paper partially answer this problem by
proving for a regular graph with some acceptable
conditions. As applications, the conditional diagnosability and the 2-extra
connectivity are determined for some well-known classes of vertex-transitive
graphs, including, star graphs, -star graphs, alternating group
networks, -arrangement graphs, alternating group graphs, Cayley graphs
obtained from transposition generating trees, bubble-sort graphs, -ary
-cube networks and dual-cubes. Furthermore, many known results about these
networks are obtained directly
Neighbor connectivity of -ary -cubes
The neighbor connectivity of a graph is the least number of vertices such
that removing their closed neighborhoods from results in a graph that is
disconnected, complete or empty. If a~graph is used to model the topology of an
interconnection network, this means that the failure of a network node causes
failures of all its neighbors. We completely determine the neighbor
connectivity of -ary -cubes for all and .Comment: 11 pages, 1 figur