姓  名：林瑞智

职  称：讲师

电子邮箱：；linruizhi2018@fjut.edu.cn

教育背景：

理学学士 (数学与应用数学), 兰州大学, 中国, 2012;

理学博士 (应用数学), 兰州大学, 中国, 2018.

讲授课程:

高等数学、线性代数、概率论与数理统计、应用信息论、时间序列分析、图与网络、矩阵论

研究领域:

图论及其应用

科研项目（纵向、横向）：

1.福建省自然科学基金青年项目，正则图的条件匹配排除与反凯库勒问题研究（项目编号：2022J05199 ），2022.8-至今，8万元，在研，主持。

3.福建省教育厅中青年教师教育科研项目（项目编号：JAT190417），2019.1-至今，0.5万元，在研，主持。

代表性论文：

1.Ruizhi Lin, Heping Zhang, The restricted edge-connectivity and restricted connectivity of augmented k-ary n-cubes, Int. J. Comp. Math. 93 (2016) 1281-1298.

2.Ruizhi Lin, Heping Zhang, Maximally matched and super matched regular graphs, Int. J. Comp. Math.: Comp. Syst. Theo. 1 (2016) 74-84.

3.Ruizhi Lin, Heping Zhang, Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs, Discrete Appl. Math. 233 (2017) 104-117.

4.Ruizhi Lin, Heping Zhang, Conditional matching preclusion for folded hypercubes, J.Int. Net. 19 (2019) 1940011 (16 pages).

5.Ruizhi Lin, Heping Zhang, Weisheng Zhao, Matching preclusion for direct product of regular graphs, Discrete Appl. Math. 277 (2020) 221-230.

6.Ruizhi Lin, Heping Zhang, Fractional matching preclusion number of graphs and the perfect matching polytope, J. Combin. Opt. 39 (2020) 915-932.

7.Lingjuan Shi, Heping Zhang, Ruizhi Lin, Characterizing the fullerene graphs with the minimum forcing number 3, Discrete Appl. Math. 294 (2021) 181-204.

8.Ruizhi Lin, Conditional matching preclusion for regular bipartite graphs and their

Cartesian product, Discrete Appl. Math. 299 (2021) 17-25.

9.Zhao Weisheng, Ruizhi Lin, Cai Junqing, On construction for trees making the equality hold in Vizing's conjecture, J. Graph Theory, 101 (2022), 397-427.

10.Jing Lin, Lunan Jia, Ruizhi Lin, Max-Bisections on Strong Product of Paths and Cycles, J.Int. Net., (2025) 2550003.