Mingzu Zhang

Orcid: 0000-0002-2621-9022

According to our database1, Mingzu Zhang authored at least 26 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Concentration behavior: 50 percent of h-extra edge connectivity of pentanary n-cube with exponential faulty edges.
J. Comb. Optim., March, 2024

Link fault tolerance of BC networks and folded hypercubes on <i>h</i>-extra <i>r</i>-component edge-connectivity.
Appl. Math. Comput., February, 2024

Concentration phenomenon about h-extra edge-connectivity of the n-th cartesian product of complete graph K<sub>4</sub> with large-scale faulty links.
J. Supercomput., January, 2024

2023
The <i>a</i>-average Degree Edge-Connectivity of Bijective Connection Networks.
Comput. J., September, 2023

Many-to-many edge-disjoint paths in (<i>n</i>,<i>k</i>)-enhanced hypercube under three link-faulty hypotheses.
Theor. Comput. Sci., May, 2023

The generalized measure of edge fault tolerance in exchanged 3-ary <i>n</i>-cube.
Int. J. Parallel Emergent Distributed Syst., May, 2023

Fault tolerance analysis for hamming graphs with large-scale faulty links based on <i>k</i>-component edge-connectivity.
J. Parallel Distributed Comput., March, 2023

Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks.
Int. J. Found. Comput. Sci., January, 2023

An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity.
Parallel Process. Lett., 2023

2022
A unified approach to reliability and edge fault tolerance of cube-based interconnection networks under three hypotheses.
J. Supercomput., 2022

Reliability analysis of the pentanary n-cube based on h-extra edge-connectivity with a concentration behavior.
J. Supercomput., 2022

Reliability measure of the <i>n</i>-th cartesian product of complete graph <i>K</i><sub>4</sub> on <i>h</i>-extra edge-connectivity.
Theor. Comput. Sci., 2022

Reliability Evaluation of Augmented Cubes on Degree.
J. Interconnect. Networks, 2022

A novel view: edge isoperimetric methods and reliability evaluation of several kinds of conditional edge-connectivity of interconnection networks.
CoRR, 2022

2021
Exponential type of many-to-many edge disjoint paths on ternary <i>n</i>-cubes.
J. Parallel Distributed Comput., 2021

Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks.
Int. J. Found. Comput. Sci., 2021

Many-to-Many Disjoint Paths in Augmented Cubes With Exponential Fault Edges.
IEEE Access, 2021

A Novel View: Edge is Operimetric Methods and Reliability Evaluation of Several kinds of Conditional Edge-connectivity of Interconnection Networks.
Proceedings of the 21st IEEE International Conference on Software Quality, 2021

2020
Path 3-(edge-)connectivity of lexicographic product graphs.
Discret. Appl. Math., 2020

2019
The Restricted Edge-Connectivity of Kronecker Product Graphs.
Parallel Process. Lett., 2019

2018
An O(log<sub>2</sub>(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes.
IEEE Trans. Reliab., 2018

An O(|E(G)|<sup>2</sup>) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs.
J. Comb. Optim., 2018

Enumeration of perfect matchings of lattice graphs by Pfaffians.
Appl. Math. Comput., 2018

2017
A Sufficient Condition for Pfaffian Graphs on the Torus.
Graphs Comb., 2017

2016
Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes.
Theor. Comput. Sci., 2016

2014
Reliability analysis of bijective connection networks in terms of the extra edge-connectivity.
Inf. Sci., 2014


  Loading...