|
个人信息：Personal Information
副教授 研究生导师
性别：男
毕业院校：兰州大学
学历：博士研究生毕业
学位：博士学位
在职信息：在岗
所在单位：数学与统计学院
入职时间：2012-01-01
学科：应用数学
办公地点：新校区行政辅楼
电子邮箱：
扫描关注
- [1]Wantao Ning and Hao Li, The generalized 3-connectivity of exchanged folded hypercubes, Axioms 13 (3) (2024) 194.
- [2]Wantao Ning and Litao Guo, The generalized 3-connectivity of exchanged crossed cube, International Journal of Foundations of Computer Science (online)
- [3]Wantao Ning and Litao Guo, Connectivity and super connectivity of the exchanged 3-ary n-cube, Theoretical Computer Science 923 (2022) 160–166.
- [4]B. Li, J.F. Lan, W.T. Ning, Y.C. Tian, X. Zhang and Q. Zhu, h-extra r-component connectivity of interconnection networks with application to hypercubes, Theoretical Computer Science 895 (2021) 68-74.
- [5]Wantao Ning and Hao Li, The generalized measure of edge fault tolerance in exchanged crossed cube, Theoretical Computer Science 861 (2021) 80–84.
- [6]Wantao Ning, Connectivity and super connectivity of the divide-and-swap cube, Theoretical Computer Science 842 (2020) 1–5.
- [7]Wantao Ning, The Connectivity of Exchanged Folded Hypercube, Parallel Processing Letters 30 (1) (2020) 2050003 (5 pages).
- [8]Qiuli Li and Wantao Ning, Matching preclusion for exchanged hypercubes, Journal of Interconnection Networks, 19 (3) (2019) 1940008 (9 pages).
- [9]Wantao Ning, The h-connectivity of exchanged crossed cube (vol 696, pg 65, 2017), Theoretical Computer Science 705 (2018) 118-121.
- [10]Wantao Ning, The h-connectivity of exchanged crossed cube, Theoretical Computer Science 696 (2017) 65–68.
- [11]Wantao Ning, The super connectivity of exchanged crossed cube.INFORMATION PROCESSING LETTERS.2016,116 (2):80-84
- [12]Wantao Ning, Xiaoli Feng and Ling Wang,The connectivity of exchanged crossed cube.INFORMATION PROCESSING LETTERS.2015,115 (2):394-396
- [13]Hao Li, Wantao Ning and Junqing Cai, On the existence of hamiltonian cycles after removing edges, Utilitas Mathematica 97 (2015) 329-353.
- [14]Junqing Cai, Hao Li and Wantao Ning, An implicit weighted degree condition for heavy cycles, Discussiones Mathematicae-Graph Theory 34 (2014) 801-810.
- [15]Wantao Ning and Xiaoli Feng, A simple proof to the connectivity of exchanged hypercubes, Utilitas Mathematica 92 (2013) 337-340.
- [16]Hao Li, Junqing Cai and Wantao Ning, An implicit degree condition for pancyclicity of graphs, Graphs and Combinatorics 29 (2013) 1459-1469.
- [17]Junqing Cai, Hao Li and Wantao Ning, An implicit degree condition for hamiltonian cycles, Ars Combinatoria 108 (2013) 365-378.
- [18]Hao Li, Wantao Ning and Junqing Cai, An implicit degree condition for hamiltonian graphs, Discrete Mathematics 312 (2012) 2190-2196.
- [19]Hao Li, Wantao Ning and Junqing Cai, An implicit degree condition for cyclability in graphs, Lecture Notes in Computer Science 6681 (2011) 82-89.
- [20]Wantao Ning,Qiuli Li and Heping Zhang, Smallest generalized cuts and diameter-increasing sets of Johnson graphs, Ars Combinatoria 95 (2010) 353-362.
| |