Abstract
The ℓ-component connectivity (or ℓ-connectivity for short) of a graph G, denoted by κℓ(G), is the minimum number of vertices whose removal from G 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 n-dimensional alternating group networks ANn and obtained the result κ3(ANn)=2n−3 for n⩾4. In this sequel, we continue the work and show that κ4(ANn)=3n−6 for n⩾4.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
