The 2-Extra Connectivity and 2-Extra Diagnosability of Bubble-Sort Star Graph Networks

Wang, Shiying; Wang, Zhenhua; Wang, Mujiangshan

doi:10.1093/comjnl/bxw037

Cited by 73 publications

(17 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Guo et al [11] showed that the conditional diagnosability of the bubble-sort star graph BS n under the MM model is 6n − 15 for n ≥ 6 and under the PMC model is 8n − 21 for n ≥ 5. In 2016, Wang et al [37] studied that the 2-extra diagnosability of BS n under the PMC model and MM * model. In this paper, the diagnosability of the n-dimensional bubble-sort star graph BS n under the PMC model and MM * model has been studied.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Wang

2017

Discrete Applied Mathematics

Self Cite

View full text Add to dashboard Cite

Connectivity plays an important role in measuring the fault tolerance of interconnection networks. The g-good-neighbor connectivity of an interconnection network G is the minimum cardinality of g-good-neighbor cuts. Diagnosability of a multiprocessor system is one important study topic. A new 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 bubblesort star graph BS n has many good properties. In this paper, we prove that 2-good-neighbor connectivity of BS n is 8n − 22 for n ≥ 5 and the 2-good-neighbor connectivity of BS 4 is 8; the 2-good-neighbor diagnosability of BS n is 8n − 19 under the PMC model and MM * model for n ≥ 5.

show abstract

Section: Introductionmentioning

confidence: 99%

“…connected graph G is super connected if every minimum cut F of G isolates one vertex. If, in addition, G − F has two components, one of which is an isolates vertex, then G is tightly |F | super connected.Theorem 2.12 [37]. For n ≥ 4, the bubble-sort star graph BS n is tightly (2n − 3) super connected.Fig.…”

mentioning

confidence: 99%

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

Wang

2017

Discrete Applied Mathematics

Self Cite

View full text Add to dashboard Cite

show abstract

“…Gu et al [8] determined the pessimistic diagnosability of BS n . Wang et al [21,22] studied the 2-extra connectivity (resp. 2-good-neighbor connectivity) and the 2-extra diagnosability (resp.…”

Section: Introductionmentioning

confidence: 99%

Edge-Bipancyclicity of Bubble-Sort Star Graphs

Guo

2019

IEEE Access

View full text Add to dashboard Cite

The interconnection network considered in this paper is the bubble-sort star graph. The n-dimensional bubble-sort star graph BS n is a bipartite and (2n − 3)-regular graph of order n!. A bipartite graph G is edge-bipancyclic if each edge of G lies on a cycle of all even length l with 4 ≤ l ≤ |V (G)|. In this paper, we show that the n-dimensional bubble-sort star graph BS n is edge-bipancyclic for n ≥ 3 and for each even length l with 4 ≤ l ≤ n!, every edge of BS n lies on at least four different cycles of length l.

show abstract

“…The n-dimensional bubble-sort star graph n BS has many good properties. In 2016, Wang et al [13] studied the 2-extra diagnosability of n BS under the PMC model and MM* model.…”

Section: Introductionmentioning

confidence: 99%

The 2-Extra Diagnosability of Alternating Group Graphs under the PMC Model and MM* Model

Wang¹,

Ren²

2018

AJCM

Self Cite

View full text Add to dashboard Cite

Diagnosability of a multiprocessor system is one important study topic. In 2015, Zhang et al. proposed a new measure for fault diagnosis of the system, namely, g-extra diagnosability, which restrains that every fault-free component has at least ( ) 1 g + fault-free nodes. As a favorable topology structure of interconnection networks, the n-dimensional alternating group graph AG n has many good properties. In this paper, we give that the 2-extra diagnosability of AG n is 6 17 n − for 5 n ≥ under the PMC model and MM* model.

show abstract

The 2-Extra Connectivity and 2-Extra Diagnosability of Bubble-Sort Star Graph Networks

Cited by 73 publications

References 32 publications

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

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

Edge-Bipancyclicity of Bubble-Sort Star Graphs

The 2-Extra Diagnosability of Alternating Group Graphs under the PMC Model and MM* Model

Contact Info

Product

Resources

About