2 research outputs found

    The 4-Component Connectivity of Alternating Group Networks

    Full text link
    The β„“\ell-component connectivity (or β„“\ell-connectivity for short) of a graph GG, denoted by ΞΊβ„“(G)\kappa_\ell(G), is the minimum number of vertices whose removal from GG results in a disconnected graph with at least β„“\ell components or a graph with fewer than β„“\ell vertices. This generalization is a natural extension of the classical connectivity defined in term of minimum vertex-cut. As an application, the β„“\ell-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 β„“\ell-connectivity for particular classes of graphs and small β„“\ell's. In a previous work, we studied the β„“\ell-connectivity on nn-dimensional alternating group networks ANnAN_n and obtained the result ΞΊ3(ANn)=2nβˆ’3\kappa_3(AN_n)=2n-3 for nβ©Ύ4n\geqslant 4. In this sequel, we continue the work and show that ΞΊ4(ANn)=3nβˆ’6\kappa_4(AN_n)=3n-6 for nβ©Ύ4n\geqslant 4

    The Component Connectivity of Alternating Group Graphs and Split-Stars

    Full text link
    For an integer β„“β©Ύ2\ell\geqslant 2, the β„“\ell-component connectivity of a graph GG, denoted by ΞΊβ„“(G)\kappa_{\ell}(G), is the minimum number of vertices whose removal from GG results in a disconnected graph with at least β„“\ell components or a graph with fewer than β„“\ell 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 β„“\ell-connectivity are known only for a few classes of networks and small β„“\ell's. It has been pointed out in~[Component connectivity of the hypercubes, Int. J. Comput. Math. 89 (2012) 137--145] that determining β„“\ell-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 AGnAG_n and a variation of the star graphs called split-stars Sn2S_n^2, we study their β„“\ell-component connectivities. We obtain the following results: (i) ΞΊ3(AGn)=4nβˆ’10\kappa_3(AG_n)=4n-10 and ΞΊ4(AGn)=6nβˆ’16\kappa_4(AG_n)=6n-16 for nβ©Ύ4n\geqslant 4, and ΞΊ5(AGn)=8nβˆ’24\kappa_5(AG_n)=8n-24 for nβ©Ύ5n\geqslant 5; (ii) ΞΊ3(Sn2)=4nβˆ’8\kappa_3(S_n^2)=4n-8, ΞΊ4(Sn2)=6nβˆ’14\kappa_4(S_n^2)=6n-14, and ΞΊ5(Sn2)=8nβˆ’20\kappa_5(S_n^2)=8n-20 for nβ©Ύ4n\geqslant 4
    corecore