Mei-Mei Gu

Orcid: 0000-0002-8749-0860

According to our database1, Mei-Mei Gu authored at least 36 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements.
Theor. Comput. Sci., February, 2024

2023
Subversion analyses of hierarchical networks based on (edge) neighbor connectivity.
J. Parallel Distributed Comput., January, 2023

Neighbor connectivity of pancake graphs and burnt pancake graphs.
Discret. Appl. Math., 2023

2021
A Note on Super Connectivity of the Bouwer Graph.
J. Interconnect. Networks, 2021

Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions.
Discret. Appl. Math., 2021

Reliability Analysis of Alternating Group Graphs and Split-Stars.
Comput. J., 2021

Strong Menger Connectedness of Augmented k-ary n-cubes.
Comput. J., 2021

2020
Relationship between extra edge connectivity and component edge connectivity for regular graphs.
Theor. Comput. Sci., 2020

On Component Connectivity of Hierarchical Star Networks.
Int. J. Found. Comput. Sci., 2020

Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs.
Discret. Appl. Math., 2020

Note on Applications of Linearly Many Faults.
Comput. J., 2020

On Computing Component (Edge) Connectivities of Balanced Hypercubes.
Comput. J., 2020

Neighbor connectivity of <i>k</i>-ary <i>n</i>-cubes.
Appl. Math. Comput., 2020

2019
Fault diagnosability of data center networks.
Theor. Comput. Sci., 2019

Strongly Menger connectedness of data center network and (<i>n</i>, <i>k</i>)-star graph.
Theor. Comput. Sci., 2019

Neighbor connectivity of k-ary n-cubes.
CoRR, 2019

Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity.
IEEE Access, 2019

2018
The pessimistic diagnosability of data center networks.
Inf. Process. Lett., 2018

Fault-tolerance and diagnosability of hierarchical star networks.
Int. J. Comput. Math. Comput. Syst. Theory, 2018

Reliability analysis of Cayley graphs generated by transpositions.
Discret. Appl. Math., 2018

The Component Connectivity of Alternating Group Graphs and Split-Stars.
CoRR, 2018

The 3-extra Connectivity and Faulty Diagnosability.
Comput. J., 2018

Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges.
Ars Comb., 2018

2017
The g-good-neighbor diagnosability of (n, k)-star graphs.
Theor. Comput. Sci., 2017

Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs.
Theor. Comput. Sci., 2017

The 1-Good-Neighbor Conditional Diagnosability of Some Regular Graphs.
J. Interconnect. Networks, 2017

On the extraconnectivity of k-ary n-cube networks.
Int. J. Comput. Math., 2017

The pessimistic diagnosability of three kinds of graphs.
Discret. Appl. Math., 2017

2016
Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges.
Theor. Comput. Sci., 2016

The pessimistic diagnosabilities of some general regular graphs.
Theor. Comput. Sci., 2016

A Note on the Pessimistic Diagnosability of Augmented Cubes.
J. Interconnect. Networks, 2016

A Short Note on the 1, 2-Good-Neighbor Diagnosability of Balanced Hypercubes.
J. Interconnect. Networks, 2016

Edge Fault-Tolerant Strong Hamiltonian Laceability of Balanced Hypercubes.
J. Interconnect. Networks, 2016

The pessimistic diagnosability of bubble-sort star graphs and augmented k-ary n-cubes.
Int. J. Comput. Math. Comput. Syst. Theory, 2016

2015
Fault-Tolerant Cycle Embedding in Balanced Hypercubes with Faulty Vertices and Faulty Edges.
J. Interconnect. Networks, 2015

2014
3-extra connectivity of 3-ary n-cube networks.
Inf. Process. Lett., 2014


  Loading...