姓名：李恒哲 副教授 碩士生導(dǎo)師

電子郵件：[email protected], [email protected]

通信地址：數(shù)學(xué)與信息科學(xué)學(xué)院

郵　　編：453007

李恒哲,，男,，1982年4月出生，副教授,，博士,，校青年骨干教師（2016）,。 2007-2010年，新疆大學(xué)數(shù)學(xué)學(xué)院跟隨孟吉翔教授讀碩士,，研究方向運籌學(xué)與控制論,，獲理學(xué)碩士學(xué)位； 2010-2013年,，在南開大學(xué)組合數(shù)學(xué)中心跟隨李學(xué)良教授讀博士,，研究方向圖論與組合最優(yōu)化，獲理學(xué)博士學(xué)位,； 2013.6,，南開大學(xué)博士畢業(yè)，到河南師范大學(xué)任教,。已畢業(yè)碩士1人,，在讀碩士2人。

組合數(shù)學(xué)與圖論：圖的樹連通度,，圖的彩虹連通性,，圖的連通控制數(shù)等。

主講本科生課程高等數(shù)學(xué),、C語言和多媒體課件制作,，主講研究生課程離散數(shù)學(xué)、圖論,、組合論,、和組合最優(yōu)化。

2016 校青年骨干教師

在研項目

1.國家自然科學(xué)基金青年基金,，11501181,，強度大于2的混合正交表的構(gòu)造及其應(yīng)用，

2016/01-2018/12，18萬,，參與

2.國家自然科學(xué)基金青年基金,，11701157，關(guān)于傳遞圖的全彩虹連通數(shù)的研究,，

2018/01-2020/12,，24萬,，參與

完成項目

1.國家自然科學(xué)基金青年基金,，11526082，關(guān)于彩虹連通數(shù)和傳統(tǒng)圖參數(shù)關(guān)系的研究,， 2015/01-2017/12,，23萬，主持

2.河南省教育廳,，15A110032,，關(guān)于2-（邊）連通控制數(shù)的研究，2015/01-2017/12,，2萬,，主持

3.國家自然科學(xué)基金天元基金，11526082,，關(guān)于點傳遞圖的彩虹連通數(shù)的研究,，

2016/01-2016/12，3萬,，參與

4.國家自然科學(xué)基金天元基金,，11526081，壓縮感知中正交匹配追蹤算法的理論研究

2016/01-2016/12,，3萬,，參與

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 connected，Discussiones 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 products,，Applied Mathematics and Computation, 295(2017) 77-83.

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

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 graph，Journal of Combinatorial Optimization, 31(2016) 713-724.

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

16.Xingchao Deng, Hengzhe Li, Guiying Yan,，Algorithm 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 trees，International 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 circulants,，Ars Combinatoria, 122(2015) 3-12.

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

21.Hengzhe Li, Xueliang Li, Yaping Mao, Yuefang Sun,，Note on the generalized connectivity,，Ars 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 vertices，Bulletin 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 graph,，Discrete 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.