English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Diagnosability of a multiprocessor system is an important topic of study. A measure for fault diagnosis of the system restrains that every fault-free node has at least g fault-free neighbor vertices, which is called the g-good-neighbor diagnosability of the system. As a famous topology structure of interconnection networks, the n-dimensional bubble-sort graphB nhas many good properties. In this paper, we prove that (1) the 1-good-neighbor diagnosability ofB nis2 n − 3under Preparata, Metze, and Chien’s (PMC) model forn ≥ 4and Maeng and Malek’s (MM)∗model forn ≥ 5    ; (2) the 2-good-neighbor diagnosability ofB nis4 n − 9under the PMC model and the MM∗model forn ≥ 4    ; (3) the 3-good-neighbor diagnosability ofB nis8 n − 25under the PMC model and the MM∗model forn ≥ 7    .

The g-Good-Neighbor Diagnosability of Bubble-Sort Graphs under Preparata, Metze, and Chien’s (PMC) Model and Maeng and Malek’s (MM)* Model