Edge-fault-tolerant strong Menger edge connectivity of bubble-sort graphs

This paper studies the edge-fault-tolerant strong Menger edge connectivity of n- dimensional bubble-sort graph B-n. We give the values of faulty edges that B-n can tolerant when B-n is strongly Menger edge connected under two conditions. When there are (n - 3) faulty edges removed from B-n, the B-n network is still working and it is strongly Menger edge connected. When the condition of any vertex in B-n has at least two neighbors is imposed, the number of faulty edges that can removed from Bn is (2n - 6) when Bn is also strongly Menger edge connected. And two special cases are used to illustrate the correctness of the conclusions. The conclusions can help improve the reliability of the interconnection networks.

Automated summary

This paper explores the edge-fault-tolerant strong Menger edge connectivity in n-dimensional bubble-sort graph B-n, determining the number of faulty edges that can be tolerated under different conditions. The conclusions are validated through special cases, demonstrating ways to enhance the reliability of interconnection networks.