Wantao Ning

Orcid: 0000-0002-0995-1246

According to our database1, Wantao Ning authored at least 22 papers between 2010 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
The Generalized 4-Connectivity of Locally Exchanged Twisted Cubes.
Int. J. Found. Comput. Sci., 2026

2025
On the fault diameter and wide diameter of the exchanged 3-ary <i>n</i>-cube.
CoRR, August, 2025

Connectivity and super connectivity of enhanced folded hypercube-like networks.
Discret. Appl. Math., 2025

2024
The Generalized 3-Connectivity of Exchanged Crossed Cube.
Int. J. Found. Comput. Sci., December, 2024

The Generalized 3-Connectivity of Exchanged Folded Hypercubes.
Axioms, March, 2024

2022
Connectivity and super connectivity of the exchanged 3-ary <i>n</i>-cube.
Theor. Comput. Sci., 2022

2021
The generalized measure of edge fault tolerance in exchanged crossed cube.
Theor. Comput. Sci., 2021

<i>h</i>-extra <i>r</i>-component connectivity of interconnection networks with application to hypercubes.
Theor. Comput. Sci., 2021

2020
Connectivity and super connectivity of the divide-and-swap cube.
Theor. Comput. Sci., 2020

The Connectivity of Exchanged Folded Hypercube.
Parallel Process. Lett., 2020

2019
Matching Preclusion for Exchanged Hypercubes.
J. Interconnect. Networks, 2019

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

2017
The h-connectivity of exchanged crossed cube.
Theor. Comput. Sci., 2017

2016
The super connectivity of exchanged crossed cube.
Inf. Process. Lett., 2016

2015
The connectivity of exchanged crossed cube.
Inf. Process. Lett., 2015

A wavelet regularization method for solving numerical analytic continuation.
Int. J. Comput. Math., 2015

2014
An implicit weighted degree condition for heavy cycles.
Discuss. Math. Graph Theory, 2014

2013
An Implicit Degree Condition for Pancyclicity of Graphs.
Graphs Comb., 2013

An implicit degree condition for hamiltonian cycles.
Ars Comb., 2013

2012
An implicit degree condition for hamiltonian graphs.
Discret. Math., 2012

2011
An Implicit Degree Condition for Cyclability in Graphs.
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.
Ars Comb., 2010


  Loading...