2 research outputs found
The 4-Component Connectivity of Alternating Group Networks
The -component connectivity (or -connectivity for short) of a
graph , denoted by , is the minimum number of vertices whose
removal from results in a disconnected graph with at least
components or a graph with fewer than vertices. This generalization is a
natural extension of the classical connectivity defined in term of minimum
vertex-cut. As an application, the -connectivity can be used to assess
the vulnerability of a graph corresponding to the underlying topology of an
interconnection network, and thus is an important issue for reliability and
fault tolerance of the network. So far, only a little knowledge of results have
been known on -connectivity for particular classes of graphs and small
's. In a previous work, we studied the -connectivity on
-dimensional alternating group networks and obtained the result
for . In this sequel, we continue the work
and show that for
The Component Connectivity of Alternating Group Graphs and Split-Stars
For an integer , the -component connectivity of a
graph , denoted by , is the minimum number of vertices
whose removal from results in a disconnected graph with at least
components or a graph with fewer than vertices. This is a natural
generalization of the classical connectivity of graphs defined in term of the
minimum vertex-cut and is a good measure of robustness for the graph
corresponding to a network. So far, the exact values of -connectivity are
known only for a few classes of networks and small 's. It has been
pointed out in~[Component connectivity of the hypercubes, Int. J. Comput. Math.
89 (2012) 137--145] that determining -connectivity is still unsolved for
most interconnection networks, such as alternating group graphs and star
graphs. In this paper, by exploring the combinatorial properties and
fault-tolerance of the alternating group graphs and a variation of the
star graphs called split-stars , we study their -component
connectivities. We obtain the following results: (i) and
for , and for
; (ii) , , and
for