default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWantao Ning
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Wantao Ning
, Hao Li:
The Generalized 3-Connectivity of Exchanged Folded Hypercubes. Axioms 13(3): 194 (2024)- 2022
- [j16]Wantao Ning, Litao Guo:
Connectivity and super connectivity of the exchanged 3-ary n-cube. Theor. Comput. Sci. 923: 160-166 (2022) - 2021
- [j15]Wantao Ning, Hao Li:
The generalized measure of edge fault tolerance in exchanged crossed cube. Theor. Comput. Sci. 861: 80-84 (2021) - [j14]Bi Li, Jingfen Lan, Wantao Ning, Yongcui Tian, Xin Zhang, Qiang Zhu:
h-extra r-component connectivity of interconnection networks with application to hypercubes. Theor. Comput. Sci. 895: 68-74 (2021) - 2020
- [j13]Wantao Ning:
The Connectivity of Exchanged Folded Hypercube. Parallel Process. Lett. 30(1): 2050003:1-2050003:5 (2020) - [j12]Wantao Ning:
Connectivity and super connectivity of the divide-and-swap cube. Theor. Comput. Sci. 842: 1-5 (2020)
2010 – 2019
- 2019
- [j11]Qiuli Li, Wantao Ning:
Matching Preclusion for Exchanged Hypercubes. J. Interconnect. Networks 19(3): 1940008:1-1940008:9 (2019) - 2018
- [j10]Wantao Ning:
Erratum and corrections to "The h-connectivity of exchanged crossed cube" [Theoret. Comput. Sci. 696 (2017) 65-68]. Theor. Comput. Sci. 705: 118-121 (2018) - 2017
- [j9]Wantao Ning:
The h-connectivity of exchanged crossed cube. Theor. Comput. Sci. 696: 65-68 (2017) - 2016
- [j8]Wantao Ning:
The super connectivity of exchanged crossed cube. Inf. Process. Lett. 116(2): 80-84 (2016) - 2015
- [j7]Xiaoli Feng, Wantao Ning:
A wavelet regularization method for solving numerical analytic continuation. Int. J. Comput. Math. 92(5): 1025-1038 (2015) - [j6]Wantao Ning, Xiaoli Feng, Ling Wang:
The connectivity of exchanged crossed cube. Inf. Process. Lett. 115(2): 394-396 (2015) - 2014
- [j5]Junqing Cai, Hao Li, Wantao Ning:
An implicit weighted degree condition for heavy cycles. Discuss. Math. Graph Theory 34(4): 801-810 (2014) - 2013
- [j4]Junqing Cai, Hao Li, Wantao Ning:
An implicit degree condition for hamiltonian cycles. Ars Comb. 108: 365-378 (2013) - [j3]Hao Li, Junqing Cai, Wantao Ning:
An Implicit Degree Condition for Pancyclicity of Graphs. Graphs Comb. 29(5): 1459-1469 (2013) - 2012
- [j2]Hao Li, Wantao Ning, Junqing Cai:
An implicit degree condition for hamiltonian graphs. Discret. Math. 312(14): 2190-2196 (2012) - 2011
- [c1]Hao Li, Wantao Ning, Junqing Cai:
An Implicit Degree Condition for Cyclability in Graphs. FAW-AAIM 2011: 82-89 - 2010
- [j1]Wantao Ning, Qiuli Li, Heping Zhang:
Smallest generalized cuts and diameter-increasing sets of Johnson graphs. Ars Comb. 95 (2010)
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-05-08 20:55 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:
