学术信息网 西电导航 关于 使用说明 搜索 系统首页 登录 控制面板 收藏 宁万涛的留言板
学术论文

[1] Wantao Ning, Erratum and corrections to "The h-connectivity of exchanged crossed cube'' [Theoret. Comput. Sci. 696 (2017) 65–68], Theoret. Comput. Sci. 705 (2018)118–121.

[2] Wantao Ning, The h-connectivity of exchanged crossed cube, Theoret. Comput. Sci. 696 (2017) 65–68.

[3] Wantao Ning, The super connectivity of exchanged crossed cube, Information Processing Letters 116(2) (2016) 80-84.

[4] Wantao Ning, Xiaoli Feng and Ling Wang, The connectivity of exchanged crossed cube, Information Processing Letters 115(2) (2015) 394–396.

[5] Hao Li, Wantao Ning and Junqing Cai, On the existence of hamiltonian cycles after removing edges, Utilitas Mathematica 97 (2015) 329-353.

[6] Junqing Cai, Hao Li and Wantao Ning, An implicit weighted degree condition for heavy cycles, Discussiones Mathematicae-Graph Theory 34 (2014) 801-810.

[7] Hao Li, Junqing Cai and Wantao Ning, An implicit degree condition for pancyclicity of graphs, Graphs and Combinatorics 29 (2013) 1459-1469.

[8] Wantao Ning and Xiaoli Feng, A simple proof to the connectivity of exchanged hypercubes, Utilitas Mathematica 92 (2013) 337-340.

[9] Junqing Cai, Hao Li and Wantao Ning, An implicit degree condition for hamiltonian cycles, Ars Combinatoria 108 (2013) 365-378.

[10] Hao Li, Wantao Ning and Junqing Cai, An implicit degree condition for hamiltonian graphs, Discrete Mathematics 312 (2012) 2190-2196.

[11] Hao Li, Wantao Ning and Junqing Cai, An implicit degree condition for cyclability in graphs, Lecture Notes in Computer Science 6681 (2011) 82-89.

[12] Wantao Ning,Qiuli Li and Heping Zhang, Smallest generalized cuts and diameter-increasing sets of Johnson graphs,  Ars Combinatoria 95 (2010) 353-362.

版权声明:未经西安电子科技大学以及个人主页教师本人许可不得复制,转载传播本主页内容或用于任何商业用途,如需转载请征得主页所有者同意,并附上主页链接.
西安电子科技大学个人主页 站点地图 | | 宁万涛的留言板 | 更新日期 :2018-07-12 | |
Copyright © 2011-2016 西安电子科技大学 版权所有 陕ICP备021284(05016169) Powered by 信息化建设处 & 电院网络中心