scholarly journals The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks

2017 ◽  
Vol 217 ◽  
pp. 691-706 ◽  
Author(s):  
Shiying Wang ◽  
Zhenhua Wang ◽  
Mujiangshan Wang
Keyword(s):  
Star Graph ◽  
Neighbor Connectivity ◽  
Star Graph Networks ◽  
Good Neighbor

g-good-neighbor conditional diagnosability of star graph networks under PMC model and MM* model

2017 ◽  
Vol 12 (5) ◽  
pp. 1221-1234 ◽  
Author(s):  
Shiying Wang ◽  
Zhenhua Wang ◽  
Mujiangshan Wang ◽  
Weiping Han
Keyword(s):  
Star Graph ◽  
Pmc Model ◽  
Conditional Diagnosability ◽  
Star Graph Networks ◽  
Good Neighbor

Reliability Evaluation of Bicube-Based Multiprocessor System under the g-Good-Neighbor Restriction

2021 ◽  
Author(s):  
Jiafei Liu ◽  
Shuming Zhou ◽  
Eddie Cheng ◽  
Gaolin Chen ◽  
Min Li
Keyword(s):  
Cloud Computing ◽  
Reliability Evaluation ◽  
Big Data Analysis ◽  
System Level ◽  
Multiprocessor System ◽  
Multiprocessor Systems ◽  
Novel Variant ◽  
Neighbor Connectivity ◽  
Good Neighbor ◽  
Primary Strategy

Multiprocessor systems are commonly deployed for big data analysis because of evolution in technologies such as cloud computing, IoT, social network and so on. Reliability evaluation is of significant importance for maintenance and improvement of fault tolerance for multiprocessor systems, and system-level diagnosis is a primary strategy to identify the faulty processors in the systems. In this paper, we first determine the [Formula: see text]-good-neighbor connectivity of the [Formula: see text]-dimensional Bicube-based multiprocessor system [Formula: see text], a novel variant of hypercube. Besides, we establish the [Formula: see text]-good-neighbor diagnosability of the Bicube-based multiprocessor system [Formula: see text] under the PMC and MM* models.

Conditional Fault Diameter of Star Graph Networks

1996 ◽  
Vol 33 (1) ◽  
pp. 91-97 ◽  
Author(s):  
Yordan Rouskov ◽  
Shahram Latifi ◽  
Pradip K. Srimani
Keyword(s):  
Star Graph ◽  
Fault Diameter ◽  
Star Graph Networks

scholarly journals The 3-Good-Neighbor Connectivity of Modified Bubble-Sort Graphs

2020 ◽  
Vol 2020 ◽  
pp. 1-18
Author(s):  
Yanling Wang ◽  
Shiying Wang
Keyword(s):  
Cayley Graph ◽  
Connected Graph ◽  
Minimum Cardinality ◽  
Neighbor Connectivity ◽  
Good Neighbor

Let G = V G , E G be a connected graph. A subset F ⊆ V G is called a g -good-neighbor cut if G − F is disconnected and each vertex of G − F has at least g neighbors. The g -good-neighbor connectivity of G is the minimum cardinality of g -good-neighbor cuts. The n -dimensional modified bubble-sort graph MB n is a special Cayley graph. It has many good properties. In this paper, we prove that the 3-good-neighbor connectivity of MB n is 8 n − 24 for n ≥ 6 .

Wormhole broadcast in star graph networks

1998 ◽  
Vol 24 (8) ◽  
pp. 1263-1276 ◽  
Author(s):  
Shahram Latifi ◽  
Pradip K. Srimani
Keyword(s):  
Star Graph ◽  
Star Graph Networks
Sign in / Sign up

Export Citation Format

Share Document