Abstract

Connectivity is an important parameter for evaluating the reliability and stability of an interconnection network. Based on the edge connectivity, more refined connectivities have been proposed. The [Formula: see text]-component edge connectivity [Formula: see text] and the [Formula: see text]-extra edge connectivity [Formula: see text] are two important parameters to assess the robustness of an interconnection network, which received attention extensively. In this paper, we determine the [Formula: see text]-component edge connectivity and the [Formula: see text]-extra edge connectivity of bubble-sort star graphs [Formula: see text]. For [Formula: see text]-component edge connectivity, we prove that [Formula: see text], [Formula: see text], and [Formula: see text] for [Formula: see text]. For [Formula: see text]-extra edge connectivity, we prove that [Formula: see text], [Formula: see text], and [Formula: see text] for [Formula: see text].

Full Text
Paper version not known

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 call

Disclaimer: 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.