人才荟萃

李恒哲

发布时间: 2014-01-10     浏览次数:3486

姓名:李恒哲 副教授 硕士生导师

电子邮件:hengzhe_li@126.com, lhz@htu.edu.cn

通信地址:数学与信息科学学院

邮  编:453007

 

个人简历

李恒哲,男,19824月出生,副教授,博士,校青年骨干教师(2016)。 2007-2010年,新疆大学数学学院跟随孟吉翔教授读硕士,研究方向运筹学与控制论,获理学硕士学位; 2010-2013年,在南开大学组合数学中心跟随李学良教授读博士,研究方向图论与组合最优化,获理学博士学位; 2013.6,南开大学博士毕业,到河南师范大学任教。已毕业硕士1人,在读硕士2人。

 

研究领域

组合数学与图论:图的树连通度,图的彩虹连通性,图的连通控制数等。

 

教学工作

主讲本科生课程高等数学、C语言和多媒体课件制作,主讲研究生课程离散数学、图论、组合论、和组合最优化。

 

获奖情况

2016 校青年骨干教师

 

科研项目

在研项目

1.国家自然科学基金青年基金,11501181,强度大于2的混合正交表的构造及其应用,

2016/01-2018/1218万,参与

2.国家自然科学基金青年基金,11701157,关于传递图的全彩虹连通数的研究,

2018/01-2020/1224万,参与

完成项目

1.国家自然科学基金青年基金,11526082,关于彩虹连通数和传统图参数关系的研究, 2015/01-2017/1223万,主持

2.河南省教育厅,15A110032,关于2-(边)连通控制数的研究,2015/01-2017/122万,主持

3.国家自然科学基金天元基金,11526082,关于点传递图的彩虹连通数的研究,

2016/01-2016/123万,参与

4.国家自然科学基金天元基金,11526081,压缩感知中正交匹配追踪算法的理论研究

2016/01-2016/123万,参与

 

代表论文著作

1.Hengzhe Li, Xueliang Li, Yingbin Ma, The vertex-rainbow connection number of some graph operations, Discussiones Mathematicae - Graph Theory, In press.

2.Hengzhe Li, Yuanyuan Lu, Jiajia Wang, The Generalized 3-connectivity of Cartesian Product of Complete Graphs, Advances in Applied Mathematics, 8(2019), 320-326.

3.Yan Zhao, Lily Chen, Hengzhe Li, On tight bounds for the k-forcing number of a graph. Bull. Bulletin of the Malaysian Mathematical Sciences Society, 42 (2019)743–749.

4.Hengzhe Li, Baoyindureng Wu, Weihua Yang, Making a dominating set of a graph connectedDiscussiones Mathematicae - Graph Theory, 38(2018) 947-962.

5.Hengzhe Li, Baoyindureng Wu, Jixiang Meng, Yingbin Ma, Steiner tree packing number and tree connectivity. Discrete Mathematics, 341(2018) 1945-1951.

6.Hengzhe Li, Jiajia Wang, The λ3-connectivity and κ3-connectivity of recursive circulants. Applied Mathematics and Computation 339(2018) 750-757.

7.Zhao Wang, Yaping Mao, Hengzhe Li, Chengfu Ye, On the Steiner 4-Diameter of Graphs. Journal of Interconnection Networks 18(2018), 1-15.

8.Hengzhe Li, Yingbin Ma, Rainbow connection number and graph operations, Discrete Appl. Math. 230(2017), 91–99.

9.Yingbin Ma, Lily Chen, Hengzhe Li, Haifeng Li, The Proper (Vertex) Connection Numbers of Cubic Graphs, Utliltas Mathematica, 102(2017) 255-264.

10.Hengzhe Li, Xueliang Li, Yuefang Sun, Rainbow Connection Number of Graphs with Diameter Discussiones Mathematicae - Graph Theory 37(2017) 141-155.

11.Hengzhe Li, Yingbin Ma, Weihua Yang, Yifei Wang, The generalized 3-connectivity of graph productsApplied Mathematics and Computation, 295(2017) 77-83.

12.Yaping Mao, Chengfu Ye, Hengzhe Li, Shumin Zhang, The chromatic equivalence class of graph ψ3n(n3,1), Ars Combin. 135 (2017), 399421.

13.Yingbin Ma, Lily Chen, Hengzhe Li, Graphs with small total rainbow connection number. Front. Math. China, 12 (2017) 921–936.

14.Hengzhe Li ,Yuxing Yang, Baoyindureng Wu, 2-Edge connected dominating sets and 2-Connected dominating sets of a graphJournal of Combinatorial Optimization, 31(2016) 713-724.

15.Yingbin Ma, Lily Chen, Hengzhe Li, Haifeng LiThe total rainbow connection numbers of cubic graphs, Utilitas Mathematica,99(2016) 143-150.

16.Xingchao Deng, Hengzhe Li, Guiying YanAlgorithm on rainbow connection for maximal outerplanar graphs, Theoretical Computer Science, 651(2016) 76-86.

17.Weihua Yang, Hengzhe Li, Weihua He, Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating treesInternational Journal of Computer Mathematics 92(2015) 1345-1352

18.Hengzhe Li, Xueliang Li, Yaping Mao, Jun Yue, Note on the spanning-tree packing number of lexicographic product graphs, Discrete Mathematics, 338(2015) 669-673.

19.Hengzhe Li, Weihua Yang, Jixiang Meng, A kind of conditional vertex connectivity of recursive circulantsArs Combinatoria, 122(2015) 3-12.

20.Hengzhe Li, Xueliang Li, Yuefang Sun, Yan Zhao, Note on minimally d-rainbow connected graphsGraphs and Combinatorics, 30(2014) 949-955.

21.Hengzhe Li, Xueliang Li, Yaping Mao, Yuefang SunNote on the generalized connectivityArs Combinatoria, 114(2014) 193-202.

22.Hengzhe Li, Xueliang Li, Yaping Mao, On extremal graphs with at most two internally disjoint Steiner trees connecting any three verticesBulletin of the Malaysian Mathematical Sciences Society, 37(2014) 747-75.

23.Xiaolong Huang, Hengzhe Li, Xueliang Li, Yuefang Sun, Oriented diameter and rainbow connection number of a graphDiscrete Mathematics and Theoretical Computer Science, 16(2014) 51-60.

24.Weihua Yang, Yingzhi Tian, Hengzhe Li, Hao Li, Xiaofeng Guo, Theminimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree, Discrete Applied Mathematics, 167(2014) 304-309.

25.Hengzhe Li , Xueliang Li and Sujuan Liu, Rainbow connection of graphs with diameter 2, Discrete Mathematics 312 (2012) 1453–1457.

26.Hengzhe Li , Weihua Yang and Jixiang Meng, Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees, Discrete Mathematics 312 (2012) 3087–3095.

27.Hengzhe Li, Xueliang Li and Yuefang Sun, The generalized 3-connectivity of Cartesian product graphs, Discrete Mathematics and Theoretical Computer Science 14( 2012),43–54.

28.Hengzhe Li, Jixiang Meng and Weihua Yang,.3-extraconnectivity of Cayley graphs generated by transposition generating trees, Journal of Xinjiang University, (28) 2012 148-151.

29.Hengzhe Li , Xueliang Li and Sujuan Liu,The (strong) rainbow connection numbers of Cayley graphs on Abelian groups, Computers and Mathematics with Applications 62 (2011) 4082–4088.

30.Weihua Yang, Hengzhe Li and Xiaofeng Guo, A kind of conditional fault tolerance of (n,k)-star graph, Information Processing Letters 110 (2010) 1007–1011.

31.Weihua Yang, Hengzhe Li and Jixiang Meng, Conditional connectivity of Cayley graphs generated by transposition trees, Information Processing Letters 110 (2010) 1027–1030.