Mujiangshan Wang

Dr. Mujiangshan Wang

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 July 2016 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
SWShiying Wang
Shiying Wang
ZWZhenhua Wang
Zhenhua Wang
Mujiangshan WangMujiangshan Wang
Mujiangshan Wang
Connectivity plays an important role in measuring the fault tolerance of interconnection networks G=(V,E). A faulty set F⊆V is called a g-extra faulty set if every component of G−F has more than g nodes. A g-extra cut of G is a g-extra faulty set F such that G−F is disconnected. The minimum cardinality of g-extra cuts is said to be the g-extra connectivity of G. Diagnosability is an important metric for measuring the reliability of G. A new measure for fault diagnosis of G restrains that every fault-free component has at least (g+1) fault-free nodes, which is called the g-extra diagnosability of G. As a favorable topology structure of interconnection networks, the n-dimensional bubble-sort star graph BSn has many good properties. In this paper, we prove that 2-extra connectivity of BSn is 6n−15 for n≥5 and the 2-extra connectivity of BS4 is 8; the 2-extra diagnosability of BSn is 6n−13 under the PMC model for n≥5 and the 2-extra diagnosability of BSn is 6n−13 under the MM* model for n≥6.

1 May 2016 in Theoretical Computer Science
Verified
Journal Article
Closed access
Mujiangshan WangMujiangshan Wang
Mujiangshan Wang
Yuqing LinYuqing Lin
Yuqing Lin
SWShiying Wang
Shiying Wang

1 January 2017 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
SWShiying Wang
Shiying Wang
ZWZhenhua Wang
Zhenhua Wang
Mujiangshan WangMujiangshan Wang
Mujiangshan Wang

5 February 2016 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
Mujiangshan WangMujiangshan Wang
Mujiangshan Wang
YGYubao Guo
Yubao Guo
Mujiangshan WangMujiangshan Wang
Mujiangshan Wang
Diagnosability is an important metric for measuring the reliability of multiprocessor systems. In 2012, Peng et al. proposed a new measure for fault tolerance of the system, which is called g-good-neighbour diagnosability that restrains every fault-free node containing at least g fault-free neighbours. As a favourable topology structure of interconnection networks, the Cayley graph CΓn generated by the transposition tree Γn has many good properties. In this paper, we give that the 1-good-neighbour diagnosability of CΓn under the PMC model and MM ∗ model is 2n−3 except the bubble-sort graph B4 under MM ∗ model, where n≥4, and the 1-good-neighbour diagnosability of B4 under the MM ∗ model is 4.

11 December 2024 in Theoretical Computer Science
Verified
Journal Article
Closed access
Mujiangshan WangMujiangshan Wang
Mujiangshan Wang
DXDong Xiang
Dong Xiang
SHSun-Yuan Hsieh
Sun-Yuan Hsieh

1 June 2019 in Theoretical Computer Science
Verified
Journal Article
Closed access
SWShiying Wang
Shiying Wang
Mujiangshan WangMujiangshan Wang
Mujiangshan Wang