发表的科学研究论文：
Shengjie He, Rong-Xia Hao, Fengming Dong, The rank of a complex unit gain graph in terms of the matching number, Linear Algebra and its Applications, 589(2020)158-185.
Shengjie He, Rong-Xia Hao, Hong-Jian Lai, Bounds for the matching number and cyclomatic number of a signed graph in terms of rank, Linear Algebra and its Applications, 572(2019) 273-291.
Shengjie He, Rong-Xia Hao, Aimei Yu, Bounds for the rank of a complex unit gain graph in terms of the independence number, Linear and Multilinear Algebra, In Press, https://doi.org/10.1080/03081087.2020.1761768.
Shengjie He, Rong-Xia Hao, Liancui Zuo, The linear (n-1)-arboricity of some lexicographic product graphs, Applied Mathematics and Computation, 338(2018) 152-163.
Shengjie He, Rong-Xia Hao, Eddie Cheng, Strongly Menger edge connectedness and strongly Menger vertex connectedness of regular networks, Theoretical Computer Science, 731(2018) 50-67.
Shengjie He, Rong-Xia Hao, Aimei Yu, On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index, Filomat, 32(11)(2018)4069-4078.
Shengjie He, Rong-Xia Hao, Yan-Quan Feng, On the edge-Szeged index of unicyclic graphs with perfect matching, Discrete Applied Mathematics, 284(2020)207-223.
Liancui Zuo, Shengjie He, Bing Xue, The linear (n-1)-arboricity of Cartesian product graphs, Applicable Analysis and Discrete Mathematics, 9(2015)13-28.
Mei-Mei Gu, Shengjie He, Rong-Xia Hao, Eddie Cheng, Strongly Menger connectedness of data center and (n, k)-star graph, Theoretical Computer Science, 799(2019) 94-103.
Shengjie He, Liancui Zuo, The linear 6-arboricity of the complete bipartite graph, Discrete Mathematics, Algorithms and Applications, 5(4)(2013)1-10.
Shengjie He, Liancui Zuo, Linear 8-arboricity of the complete bipartite graph Km,n, (Chinese) ,Advance Mathematics (China), 44(1)(2015)47-54.
Shengjie He, Liancui Zuo, The linear k-arboricity of the Mycielski graph M(Kn), WSEAS Transactions on mathematics,14(2015)1-9.