Abstract
The h-restricted edge connectivity λh is an important parameter to measure the reliability of massive parallel computing system. The λh of G is the minimum cardinality of a set of edges in G, if any, whose deletion disconnects G, and every remaining component has minimum degree at least h. The arrangement graph is a generalization of the star graph, but its order is more flexible than that of the star graph. This paper investigates the h-restricted edge connectivity of the (n,k)-arrangement graph An,k, and determines that λ1(An,k)=2k(n−k)−2, λ2(An,k)=3k(n−k)−6 with k≤n−2.
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.
