Wantao Ning

According to our database, Wantao Ning authored at least 18 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

The Generalized 3-Connectivity of Exchanged Folded Hypercubes.

Wantao Ning, Hao Li

Axioms, March, 2024

2022

Connectivity and super connectivity of the exchanged 3-ary <i>n</i>-cube.

Wantao Ning, Litao Guo

Theor. Comput. Sci., 2022

2021

The generalized measure of edge fault tolerance in exchanged crossed cube.

Wantao Ning, Hao Li

Theor. Comput. Sci., 2021

<i>h</i>-extra <i>r</i>-component connectivity of interconnection networks with application to hypercubes.

Bi Li, Jingfen Lan, Wantao Ning, Yongcui Tian, Xin Zhang, Qiang Zhu

Theor. Comput. Sci., 2021

2020

Connectivity and super connectivity of the divide-and-swap cube.

Wantao Ning

Theor. Comput. Sci., 2020

The Connectivity of Exchanged Folded Hypercube.

Wantao Ning

Parallel Process. Lett., 2020

2019

Matching Preclusion for Exchanged Hypercubes.

Qiuli Li, Wantao Ning

J. Interconnect. Networks, 2019

2018

Erratum and corrections to "The h-connectivity of exchanged crossed cube" [Theoret. Comput. Sci. 696 (2017) 65-68].

Wantao Ning

Theor. Comput. Sci., 2018

2017

The h-connectivity of exchanged crossed cube.

Wantao Ning

Theor. Comput. Sci., 2017

2016

The super connectivity of exchanged crossed cube.

Wantao Ning

Inf. Process. Lett., 2016

2015

The connectivity of exchanged crossed cube.

Wantao Ning, Xiaoli Feng, Ling Wang

Inf. Process. Lett., 2015

A wavelet regularization method for solving numerical analytic continuation.

Xiaoli Feng, Wantao Ning

Int. J. Comput. Math., 2015

2014

An implicit weighted degree condition for heavy cycles.

Junqing Cai, Hao Li, Wantao Ning

Discuss. Math. Graph Theory, 2014

2013

An Implicit Degree Condition for Pancyclicity of Graphs.

Hao Li, Junqing Cai, Wantao Ning

Graphs Comb., 2013

An implicit degree condition for hamiltonian cycles.

Junqing Cai, Hao Li, Wantao Ning

Ars Comb., 2013

2012

An implicit degree condition for hamiltonian graphs.

Hao Li, Wantao Ning, Junqing Cai

Discret. Math., 2012

2011

An Implicit Degree Condition for Cyclability in Graphs.

Hao Li, Wantao Ning, Junqing Cai

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

Smallest generalized cuts and diameter-increasing sets of Johnson graphs.

Wantao Ning, Qiuli Li, Heping Zhang

Ars Comb., 2010