The (strong) structure connectivity and (strong) substructure connectivity of the (n,k)-bubble-sort network

Jia Guo, Mei Lu and Xin Wang

Applied Mathematics and Computation, 2022, vol. 425, issue C

Abstract: A network is always viewed as a simple connected graph. The connectivity of a network can evaluate its fault tolerance and reliability. Since the faulty elements of a graph may have special structures, the (strong) structure connectivity and (strong) substructure connectivity were proposed as generalizations of connectivity. We give the (strong) structure connectivity and (strong) substructure connectivity of the (n,k)-bubble-sort network Bn,k in this paper, where the special structures are complete graphs.

Keywords: Network; Connectivity; (n,k)-bubble-sort network; Complete graph (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032200162X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:425:y:2022:i:c:s009630032200162x

DOI: 10.1016/j.amc.2022.127078

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().