Mujiangshan Wang

Orcid: 0000-0003-0950-4558

According to our database1, Mujiangshan Wang authored at least 14 papers between 2016 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Connectivity and diagnosability of center k-ary n-cubes.
Discret. Appl. Math., 2021

2020
Connectivity and Diagnosability of Leaf-Sort Graphs.
Parallel Process. Lett., 2020

2019
The <i>g</i>-good-neighbor and <i>g</i>-extra diagnosability of networks.
Theor. Comput. Sci., 2019

A Note on the Connectivity of m-Ary n-Dimensional Hypercubes.
Parallel Process. Lett., 2019

Connectivity and Matching Preclusion for Leaf-Sort Graphs.
J. Interconnect. Networks, 2019

The strong connectivity of bubble-sort star graphs.
Comput. J., 2019

2018
The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs.
Discret. Appl. Math., 2018

Sufficient conditions for graphs to be maximally 4-restricted edge connected.
Australas. J Comb., 2018

2017
The connectivity and nature diagnosability of expanded <i>k</i>-ary <i>n</i>-cubes.
RAIRO Theor. Informatics Appl., 2017

The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model.
Int. J. Comput. Math., 2017

The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks.
Discret. Appl. Math., 2017

2016
The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM<sup>⁎</sup> model.
Theor. Comput. Sci., 2016

Conditional fault tolerance in a class of Cayley graphs.
Int. J. Comput. Math., 2016

The 2-Extra Connectivity and 2-Extra Diagnosability of Bubble-Sort Star Graph Networks.
Comput. J., 2016


  Loading...