赵维胜

教育背景
2011/09-2015/06，兰州大学，应用数学，博士
2007/09-2010/06，五邑大学，应用数学，硕士
2000/09-2004/06，五邑大学，数学与应用数学（师范），学士

工作经历（科研与学术工作经历）
2015/07-至今，江汉大学，交叉学科研究院图论和网络科学与应用，助理研究员

主持或参加科研项目及人才计划项目情况
1.广东省自然科学基金，9151051501000072，图的条件连通性理论及其应用，2009.01-2011.12, 4万元，已结题，参加。

发表论文（标*为通信作者）
1. Weisheng Zhao*, Jianping Ou, On domination number of 7 times n grid graph, International Journal of Applied Mathematics and Statistics, 2013, 31(1): 43-66. EI 期刊论文
2. Weisheng Zhao*, Jianping Ou, On restricted edge connectivity of lexicographic product graphs, International Journal of Computer Mathematics, 2014, 91(8): 1618-1626. SCI 期刊论文
3. Weisheng Zhao, Heping. Zhang*, Bondage number of the strong product of two paths,  Frontiers of Mathematics in China, 2015, 10(2): 435-460. SCI 期刊论文
4. Jianping Ou*, Weisheng Zhao, On restricted edge connectivity of strong product graphs, Ars combinatoria，2015, 123: 55-64. SCI 期刊论文
5. Weisheng Zhao, Heping Zhang*, The bondage number of the strong product of a complete graph with a path and a special starlike tree, Discrete Mathematics, Algorithms and Applications, 2016, 8(1), 1650006 (14 pages). 期刊论文
6. Weisheng Zhao, Fan Wang, Xiaolu Gao, Hao Li*, Bondage number of the strong product of two trees, Discrete Applied Mathematics,  2017, 230: 133-145. SCI 期刊论文

7. Weisheng Zhao, Heping Zhang*, Upper bounds on the bondage number of the strong product of a graph and a tree,International Journal of Computer Mathematics, 2018, 95(3)：511-527. SCI 期刊论文

8. Fan Wang*, Weisheng Zhao, Matchings extend to hamiltonian cycles in 5-cube, Discussiones Mathematicae Graph Theory (2018) 38(1): 217–231. SCI 期刊论文

9. Weisheng Zhao*, Xiaolu Gao and Heping Zhang, Construction for Trees without vertices contained in all minimum dominating sets, ARS combinatoria, 2018, 138: 3-16.  SCI 期刊论文

10.Weisheng Zhao*, Fan Wang and Heping Zhang, Construction for trees with unique minimum dominating sets, International Journal of Computer Mathematics: Computer Systems Theory, 2018, 3(3) 204-213.