Min Xu

Orcid: 0000-0001-9340-5661

Affiliations:
  • Beijing Normal University, School of Mathematical Sciences, Laboratory of Mathematics and Complex Systems, China
  • University of Oklahoma, School of Computer Science, Norman, OK, USA (former)


According to our database1, Min Xu authored at least 42 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks.
Theor. Comput. Sci., February, 2023

Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model.
Theor. Comput. Sci., 2023

2022
The unpaired many-to-many <i>k</i>-disjoint paths in bipartite hypercube-like networks.
Theor. Comput. Sci., 2022

2021
Symmetric PMC model of diagnosis, <i>b</i>-matchings in graphs and fault identification in <i>t</i>-diagnosable systems.
Theor. Comput. Sci., 2021

Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model.
Theor. Comput. Sci., 2021

The (n, k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph.
Int. J. Found. Comput. Sci., 2021

Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube.
Appl. Math. Comput., 2021

The bipanconnectivity of bipartite hypercube-like networks.
Appl. Math. Comput., 2021

2020
Fault tolerance of hypercube like networks: Spanning laceability under edge faults.
Theor. Comput. Sci., 2020

Edge-fault-tolerant strong Menger edge connectivity on regular graphs.
Theor. Comput. Sci., 2020

The largest component of faulty star graphs.
Theor. Comput. Sci., 2020

The component (edge) connectivity of shuffle-cubes.
Theor. Comput. Sci., 2020

The Non-inclusive Diagnosability of Hypercubes under the MM* Model.
Int. J. Found. Comput. Sci., 2020

Fault-tolerant strong Menger (edge) connectivity of arrangement graph.
Discret. Appl. Math., 2020

Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks.
AKCE Int. J. Graphs Comb., 2020

2019
The <i>h</i>-edge tolerable diagnosability of balanced hypercubes.
Theor. Comput. Sci., 2019

Hybrid fault diagnosis capability analysis of regular graphs.
Theor. Comput. Sci., 2019

The <i>t</i>/<i>k</i>-diagnosability and strong Menger connectivity on star graphs with conditional faults.
Theor. Comput. Sci., 2019

Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults.
Int. J. Found. Comput. Sci., 2019

Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks.
Discret. Appl. Math., 2019

2018
Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes.
Theor. Comput. Sci., 2018

Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes.
Theor. Comput. Sci., 2018

Strong rainbow connection numbers of toroidal meshes.
Discret. Math. Algorithms Appl., 2018

The 1, 2-good-neighbor conditional diagnosabilities of regular graphs.
Appl. Math. Comput., 2018

2017
Conditional diagnosability of a class of matching composition networks under the comparison model.
Theor. Comput. Sci., 2017

On g-good-neighbor conditional diagnosability of (n, k)-star networks.
Theor. Comput. Sci., 2017

The Super Spanning Connectivity of Arrangement Graphs.
Int. J. Found. Comput. Sci., 2017

Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes.
Appl. Math. Comput., 2017

2014
Edge-fault-tolerant pancyclicity of arrangement graphs.
Inf. Sci., 2014

2013
On the metric dimension of line graphs.
Discret. Appl. Math., 2013

2012
The Forwarding Indices of Graphs -- a Survey
CoRR, 2012

2010
The conditional diagnosability of shuffle-cubes.
J. Syst. Sci. Complex., 2010

2009
Conditional Diagnosability of Matching Composition Networks Under the PMC Model.
IEEE Trans. Circuits Syst. II Express Briefs, 2009

The forwarding indices of wrapped butterfly networks.
Networks, 2009

2008
On conditional diagnosability of the folded hypercubes.
Inf. Sci., 2008

Identifying codes of cycles with odd orders.
Eur. J. Comb., 2008

2007
On reliability of the folded hypercubes.
Inf. Sci., 2007

Fault-tolerant analysis of a class of networks.
Inf. Process. Lett., 2007

On the restricted forwarding index problem in communication networks.
Comput. Math. Appl., 2007

Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes.
Appl. Math. Comput., 2007

2006
Edge-bipancyclicity of star graphs under edge-fault tolerant.
Appl. Math. Comput., 2006

2005
The super connectivity of shuffle-cubes.
Inf. Process. Lett., 2005


  Loading...