default search action
Dongqin Cheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j34]Heqin Liu, Dongqin Cheng
:
Structure Fault Tolerance of Exchanged Hypercube. Comput. J. 67(2): 527-536 (2024) - [j33]Heqin Liu, Dongqin Cheng
The generalized 3-connectivity and 4-connectivity of crossed cube. Discuss. Math. Graph Theory 44(2): 791 (2024) - [j32]Dongqin Cheng
The generalized 4-connectivity of balanced hypercubes. Discuss. Math. Graph Theory 44(3): 1079 (2024) - [j31]Siqi Lin, Dongqin Cheng:
Three kinds of connectivity of folded spined cubes. J. Supercomput. 80(13): 19485-19506 (2024) - 2023
- [j30]Dongqin Cheng:
Recursive definition and two edge-disjoint Hamiltonian cycles of bubble-sort star graphs. Int. J. Comput. Math. Comput. Syst. Theory 8(3): 152-159 (2023) - [j29]Dongqin Cheng
The generalized 4-connectivity of locally twisted cubes. J. Appl. Math. Comput. 69(4): 3095-3111 (2023) - [j28]Dongqin Cheng
Edge-disjoint trees passing through prescribed vertices in bubble-sort star graphs. J. Comput. Sci. 72: 102082 (2023) - [j27]Kaige Pan, Dongqin Cheng
Star structure connectivity of cayley graphs generated by transposition trees. J. Supercomput. 79(4): 4398-4411 (2023) - [j26]Dongqin Cheng:
Path covers of bubble-sort star graphs. J. Supercomput. 79(13): 14848-14868 (2023) - 2022
- [j25]Dongqin Cheng
Two disjoint cycles of various lengths in alternating group graph. Appl. Math. Comput. 433: 127407 (2022) - [j24]Heqin Liu, Dongqin Cheng
The generalized 4-connectivity of folded hypercube. Int. J. Comput. Math. Comput. Syst. Theory 7(4): 235-245 (2022) - [j23]Dongqin Cheng
Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks. Int. J. Found. Comput. Sci. 33(2): 155-173 (2022) - [j22]Dongqin Cheng
Hamiltonian Cycles Passing Through Prescribed Edges in Locally Twisted Cubes. J. Interconnect. Networks 22(2): 2150020:1-2150020:13 (2022) - [j21]Dongqin Cheng
Embedding mutually edge-disjoint cycles into locally twisted cubes. Theor. Comput. Sci. 929: 11-17 (2022) - 2021
- [j20]Dongqin Cheng
The h-restricted connectivity of balanced hypercubes. Discret. Appl. Math. 305: 133-141 (2021) - 2020
- [j19]Dongqin Cheng
Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges. Discret. Math. Algorithms Appl. 12(3): 2050036:1-2050036:20 (2020) - [j18]Zhuowen Pan, Dongqin Cheng:
Structure connectivity and substructure connectivity of the crossed cube. Theor. Comput. Sci. 824-825: 67-80 (2020) - [j17]Heqin Liu, Dongqin Cheng:
Structure fault tolerance of balanced hypercubes. Theor. Comput. Sci. 845: 198-207 (2020)
2010 – 2019
- 2019
- [j16]Dongqin Cheng
Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes. Discret. Appl. Math. 262: 56-71 (2019) - [j15]Dongqin Cheng
The pessimistic diagnosability of graphs and its applications to four kinds of interconnection networks. Int. J. Comput. Math. Comput. Syst. Theory 4(1): 37-47 (2019) - [j14]Dongqin Cheng:
Vertex-disjoint paths joining adjacent vertices in faulty hypercubes. Theor. Comput. Sci. 795: 219-224 (2019) - 2018
- [j13]Dongqin Cheng
Cycles embedding in balanced hypercubes with faulty edges and vertices. Discret. Appl. Math. 238: 56-69 (2018) - [j12]Dongqin Cheng
A relationship between g-good-neighbour conditional diagnosability and g-good-neighbour connectivity in regular graphs. Int. J. Comput. Math. Comput. Syst. Theory 3(1): 47-52 (2018) - 2017
- [j11]Dongqin Cheng
Cycles embedding in folded hypercubes under the conditional fault model. Discret. Appl. Math. 224: 60-68 (2017) - 2015
- [j10]Dongqin Cheng, Rong-Xia Hao
Embedding even cycles on folded hypercubes with conditional faulty edges. Inf. Process. Lett. 115(12): 945-949 (2015) - [j9]Dongqin Cheng, Rong-Xia Hao:
Various cycles embedding in faulty balanced hypercubes. Inf. Sci. 297: 140-153 (2015) - 2014
- [j8]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng
Two node-disjoint paths in balanced hypercubes. Appl. Math. Comput. 242: 127-142 (2014) - [j7]Dongqin Cheng, Rong-Xia Hao:
Fault-tolerant cycles embedding in hypercubes with faulty edges. Inf. Sci. 282: 57-69 (2014) - [j6]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng
Odd cycles embedding on folded hypercubes with conditional faulty edges. Inf. Sci. 282: 180-189 (2014) - [j5]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng
Vertex-fault-tolerant cycles embedding in balanced hypercubes. Inf. Sci. 288: 449-461 (2014) - 2013
- [j4]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng
Cycles embedding on folded hypercubes with faulty nodes. Discret. Appl. Math. 161(18): 2894-2900 (2013) - [j3]Dongqin Cheng, Dachang Guo:
Fault-tolerant cycle embedding in the faulty hypercubes. Inf. Sci. 253: 157-162 (2013) - [j2]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng
Conditional edge-fault pancyclicity of augmented cubes. Theor. Comput. Sci. 510: 94-101 (2013) - 2011
- [j1]Dongqin Cheng, Dachang Guo:
Cycle embedding in star graphs with more conditional faulty edges. Appl. Math. Comput. 218(7): 3856-3867 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: