MMMeijie Ma
Meijie Ma
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Meijie Ma has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
Jun-Ming Xu
13 shared publicationsGuizhen Liu
School of Mathematics and System Science, Shandong University, Jinan 250100, China
5 shared publicationsXiang-Jun Li
Yangtze Univ, Sch Informat & Math, Jingzhou 434023, Hubei, Peoples R China
4 shared publications- Xiang-Jun Li
School of Information and Mathematics, Yangtze University, Jingzhou 434023, China
4 shared publications Douglas B. West
3 shared publicationsChaoming Guo
School of Mathematics and Statistics, Qilu University of Technology (Shandong Academy of Sciences), Jinan, Shandong 250353, P. R. China
2 shared publications
Latest Publications
- Open Access
The Reliability of Cayley Graphs Generated by Transposition Trees Based on Edge Failures
Extra edge connectivity is an important parameter for measuring the reliability of interconnection networks. Given a graph G and a non-negative integer h, the h-extra edge connectivity of G, denoted by , is the minimum cardinality of a set of edges in G (if it exists) whose deletion disconnects G such that each remaining component contains at least vertices. In this paper, we obtain the h-extra edge connectivity of Cayley graphs generated by transposition trees for . As byproducts, we derive the h-extra edge connectivity of the star graph and the bubble-sort graph for .Open AccessThe Reliability of Cayley Graphs Generated by Transposition Trees Based on Edge Failures
Extra edge connectivity is an important parameter for measuring the reliability of interconnection networks. Given a graph G and a non-negative integer h, the h-extra edge connectivity of G, denoted by , is the minimum cardinality of a set of edges in G (if it exists) whose deletion disconnects G such that each remaining component contains at least vertices. In this paper, we obtain the h-extra edge connectivity of Cayley graphs generated by transposition trees for . As byproducts, we derive the h-extra edge connectivity of the star graph and the bubble-sort graph for . - 24 April 2024
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 191
The Rabin numbers of enhanced hypercubes
- 24 April 2024
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 191
The Rabin numbers of enhanced hypercubes
- 7 October 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 342, 244-252
Generalized fault-tolerance for enhanced hypercubes
- 7 October 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 342, 244-252
Generalized fault-tolerance for enhanced hypercubes
- 22 November 2022
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 34 (05) , 443-451
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube
- 22 November 2022
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 34 (05) , 443-451
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube
- 25 September 2022
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 69 (2) , 1343-1354
Disjoint paths in the enhanced hypercube with a faulty subgraph
- 25 September 2022
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 69 (2) , 1343-1354
Disjoint paths in the enhanced hypercube with a faulty subgraph
- 24 June 2022
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 12 (2) , 478-484
The Non-inclusion Diagnosability of Hypercubes Under the PMC Model
- 24 June 2022
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 12 (2) , 478-484
The Non-inclusion Diagnosability of Hypercubes Under the PMC Model
- 1 January 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 307, 88-94
Reliability assessment for modified bubble-sort networks
- 1 January 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 307, 88-94
Reliability assessment for modified bubble-sort networks
- 1 May 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 294, 108-114
Edge-disjoint paths in faulty augmented cubes
- 1 May 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 294, 108-114
Edge-disjoint paths in faulty augmented cubes
- 1 June 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (6) , 111854
List strong edge-coloring of graphs with maximum degree 4
- 1 June 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (6) , 111854
List strong edge-coloring of graphs with maximum degree 4
- 1 September 2017
- Published by Elsevier in Theoretical Computer Science
- Vol. 694, 60-65
The vulnerability of the diameter of the enhanced hypercubes
- 1 September 2017
- Published by Elsevier in Theoretical Computer Science
- Vol. 694, 60-65
The vulnerability of the diameter of the enhanced hypercubes