修正泡状排序图在PMC和MM*模型下的1近邻可诊断性

IF 1 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2025-09-18 DOI:10.1016/j.tcs.2025.115556

Asghar A. Asgharian Sardroud , Mohsen Ghasemi , Shuming Zhou

引用次数: 0

摘要

修正后的泡状排序图，记为MBn (n≥2)，是互连网络选择中值得注意的拓扑结构。本文确定了MBn的h-extra连通性。此外，我们还在PMC和MM*模型下评估了改进的泡状排序图的1近邻可诊断性。最后，我们研究了MBn的1-近邻非包容性可诊断性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The 1-good-neighbour diagnosability of modified bubblesort graphs under the PMC and MM* models

The modified bubblesort graph, denoted as

M B_{n}

(n \geq 2)

, is a noteworthy topological structure in the choice of interconnection networks. In this paper, we determine the

h

-extra connectivity of

M B_{n}

. Additionally, we evaluate the 1-good-neighbor diagnosability of modified bubblesort graphs under the PMC and

{MM}^{*}

models. Finally, we investigate the 1-good-neighbor non-inclusive diagnosability of

M B_{n}

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.