张国珍，博士，副教授，硕士生导师，主要从事图论及其应用的研究，曾作为访问学者赴美国蒙特克莱尔州立大学进行访学交流。在《Discrete Applied Mathematics》、《Applied Mathematics and Computation》、《Theoretical Computer Science》、《Discussiones Mathematicae Graph Theory》、《The Computer Journal》、《International Journal of Computer Mathematics》、《The Journal of Supercomputing》、《International Journal of Foundations of Computer Science》、《Ars Combinatoria》、《应用数学学报》等期刊发表学术论文20余篇，主持和参与国家自然科学基金及山西省自然科学基金项目10余项。主持山西省高等学校教学改革创新项目2项。多次指导学生参加全国大学生数学建模竞赛并获得国家一等奖2项、国家二等奖6项。
[1] Guozhen Zhang, Xin Liu, Dajin Wang. Component connectivity of wheel networks. Applied Mathematics and Computation, 2025, 487: 129096.
[2] Guozhen Zhang, Zhimin Yue, Dajin Wang. 1-Extra 3-component edge connectivity of modified bubble-sort networks. The Journal of Supercomputing, 2025, 81: 164.
[3] Guozhen Zhang, Dajin Wang. The structure fault tolerance of arrangement graphs. Applied Mathematics and Computation, 2021, 400: 126039.
[4] Guozhen Zhang. The preclusion numbers and edge preclusion numbers in a class of Cayley graphs. Discrete Applied Mathematics, 2020, 284: 465-471.
[5] Guozhen Zhang, Dajin Wang. Structure connectivity and substructure connectivity of bubble-sort star graph networks. Applied Mathematics and Computation, 2019, 363: 124632.
[6] Guozhen Zhang, Shangwei Lin. Path and cycle fault tolerance of bubble-sort graph networks. Theoretical Computer Science, 2019, 779: 8-16.
[7] Guozhen Zhang, Shiying Wang. Arc fault tolerance of cartesian product of regular digraphs on super-restricted arc-connectivity. Discussiones Mathematicae Graph Theory, 2019, 39(1): 95-116.
[8] Guozhen Zhang, Dajin Wang. Structure connectivity and substructure connectivity of k-ary n-cube networks. IEEE Access, 2019, 7: 134496-134504.
[9] Guozhen Zhang. Arc fault tolerance of cartesian product digraphs on hyper arc connectivity. International Journal of Computer Mathematics, 2014, 91(10): 2152-2162.
[10] 张国珍. 树的第二大特征值的界. 应用数学学报, 2018, 41(4): 473-496.
[11] Shiying Wang, Guozhen Zhang. Edge fault tolerance of regular graphs on super 3-restricted edge connectivity. Ars Combinatoria, 2019, 144: 55-80.
[12] Shiying Wang, Guozhen Zhang, Kai Feng. Edge fault tolerance of cartesian product graphs on super restricted edge connectivity. The Computer Journal, 2018, 61(5): 761-772.
[13] Shiying Wang, Guozhen Zhang, Kai Feng. Fault tolerance in k-ary n-cube networks. Theoretical Computer Science, 2012, 460: 34-41.
[14] Shiying Wang, Kai Feng, Guozhen Zhang. Strong matching preclusion for k-ary n-cubes. Discrete Applied Mathematics, 2013, 161(18): 3054-3062.
[15] Kai Feng, Shiying Wang, Guozhen Zhang. Link failure tolerance in the arrangement graphs. International Journal of Foundations of Computer Science, 2015, 26(2): 241-254.
[16] Kai Feng, Zhangjian Ji, Xuebin Lv, Guozhen Zhang, Wei Wei. Subnetwork reliability of the arrangement graphs under probabilistic fault condition. Theoretical Computer Science, 2024, 1010: 114713.
[17] 张国珍. 极大限制边连通网络的充分条件. 计算机工程与应用, 2017, 53(8): 19-22.
[18] 张国珍. 单向k-元n-方体网络. 计算机工程与应用, 2015, 51(20): 1-4.
[19] 张国珍. k-元n-方体网络的可靠性. 计算机工程与应用, 2013, 49(22): 3-6.
[1] 网络结构容错性度量研究.山西省自然科学基金面上项目, 2024.01-2026.12,主持人
[2] 网络可靠性度量研究.山西省自然科学基金面上项目, 2019.09-2022.09,主持人
[3] 数学与应用数学一流专业建设背景下数学建模案例教学与实践.山西省高等学校教学改革创新项目,2022.03-2024.03,主持人
[4] 面向案例的图论教学改革与实践.山西省高等学校教学改革创新项目,2020.03-2022.03,主持人
[5] 图论在企业优化管理中的应用.研究开发类项目,2018.10- 2021.10,主持人
[6] 超欧拉图相关问题及方法研究.国家自然科学基金青年项目, 2016.01-2018.12,参与人
[7] 类竞赛图的结构性质研究.国家自然科学基金青年项目, 2015.01-2017.12,参与人
[8] 正则多部竞赛图中圈的研究.国家自然科学基金青年项目, 2015.01-2017.12,参与人
