Document Type

Preprint

Publication Date

1-1-2025

Journal / Book Title

Journal of Supercomputing

Abstract

The classic edge connectivity of a network G is the minimum number of edges whose removal disconnects G into multiple components. It can be used as a measure of the reliability of the network. The extra edge connectivity (resp. the component edge connectivity) imposes conditions on the size (resp. the number) of components, and both are the generalizations of the classic edge connectivity. The extra component edge connectivity combines both conditional edge connectivities to measure the network’s reliability in a more particular and targeted manner. The modified bubble-sort graph MBn is a topological model proposed for the interconnection network of multicomputer systems. In this paper, we study the 1-extra 3-component edge connectivity cλ31(MBn) of the modified bubble-sort graph and prove that cλ31(MBn)=4n-6 for n≥7.

DOI

10.1007/s11227-024-06610-y

Journal ISSN / Book ISBN

85209218750 (Scopus)

Download
Link to Publisher
Link at MSU

Share

COinS