Dongqin Cheng

Orcid: 0000-0001-9933-6601

According to our database1, Dongqin Cheng authored at least 34 papers between 2011 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Three kinds of connectivity of folded spined cubes.
J. Supercomput., September, 2024

Structure Fault Tolerance of Exchanged Hypercube.
Comput. J., February, 2024

The generalized 3-connectivity and 4-connectivity of crossed cube.
Discuss. Math. Graph Theory, 2024

The generalized 4-connectivity of balanced hypercubes.
Discuss. Math. Graph Theory, 2024

2023
Path covers of bubble-sort star graphs.
J. Supercomput., September, 2023

Edge-disjoint trees passing through prescribed vertices in bubble-sort star graphs.
J. Comput. Sci., September, 2023

The generalized 4-connectivity of locally twisted cubes.
J. Appl. Math. Comput., August, 2023

Recursive definition and two edge-disjoint Hamiltonian cycles of bubble-sort star graphs.
Int. J. Comput. Math. Comput. Syst. Theory, July, 2023

Star structure connectivity of cayley graphs generated by transposition trees.
J. Supercomput., March, 2023

2022
The generalized 4-connectivity of folded hypercube.
Int. J. Comput. Math. Comput. Syst. Theory, October, 2022

Embedding mutually edge-disjoint cycles into locally twisted cubes.
Theor. Comput. Sci., 2022

Hamiltonian Cycles Passing Through Prescribed Edges in Locally Twisted Cubes.
J. Interconnect. Networks, 2022

Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks.
Int. J. Found. Comput. Sci., 2022

Two disjoint cycles of various lengths in alternating group graph.
Appl. Math. Comput., 2022

2021
The h-restricted connectivity of balanced hypercubes.
Discret. Appl. Math., 2021

2020
Structure connectivity and substructure connectivity of the crossed cube.
Theor. Comput. Sci., 2020

Structure fault tolerance of balanced hypercubes.
Theor. Comput. Sci., 2020

Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges.
Discret. Math. Algorithms Appl., 2020

2019
Vertex-disjoint paths joining adjacent vertices in faulty hypercubes.
Theor. Comput. Sci., 2019

The pessimistic diagnosability of graphs and its applications to four kinds of interconnection networks.
Int. J. Comput. Math. Comput. Syst. Theory, 2019

Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes.
Discret. Appl. Math., 2019

2018
A relationship between g-good-neighbour conditional diagnosability and g-good-neighbour connectivity in regular graphs.
Int. J. Comput. Math. Comput. Syst. Theory, 2018

Cycles embedding in balanced hypercubes with faulty edges and vertices.
Discret. Appl. Math., 2018

2017
Cycles embedding in folded hypercubes under the conditional fault model.
Discret. Appl. Math., 2017

2015
Various cycles embedding in faulty balanced hypercubes.
Inf. Sci., 2015

Embedding even cycles on folded hypercubes with conditional faulty edges.
Inf. Process. Lett., 2015

2014
Vertex-fault-tolerant cycles embedding in balanced hypercubes.
Inf. Sci., 2014

Odd cycles embedding on folded hypercubes with conditional faulty edges.
Inf. Sci., 2014

Fault-tolerant cycles embedding in hypercubes with faulty edges.
Inf. Sci., 2014

Two node-disjoint paths in balanced hypercubes.
Appl. Math. Comput., 2014

2013
Conditional edge-fault pancyclicity of augmented cubes.
Theor. Comput. Sci., 2013

Fault-tolerant cycle embedding in the faulty hypercubes.
Inf. Sci., 2013

Cycles embedding on folded hypercubes with faulty nodes.
Discret. Appl. Math., 2013

2011
Cycle embedding in star graphs with more conditional faulty edges.
Appl. Math. Comput., 2011


  Loading...