教育经历：

1979年-1983年：就读于青海师范大学数学系，获理学学士学位。

1987年-1990年：青海师范大学基础数学专业，获理学硕士学位。

1995年-1998年：四川大学应用数学专业，获理学博士学位。

1990年-1995年：青海师范大学数学系任教，讲师。

1998年- 今：hg8868官方网站数学科学院任教，讲师、副教授、教授。

中国运筹学会图论分会常务理事，

福建省运筹学会副理事长。

主要讲授课程：组合数学，图论，离散数学，数理逻辑

1.《打造精品资源，构建多元化、个性化数学人才培养模式》， 国家教学成果二等奖，教育部高教司，第四获奖人，2018年9月

2020.1-2023.12: 容斥对消理论与图多项式，国家自然科学基金面上项目.

2015.1-2018.12: 拓扑形变下标记图的计数及应用，国家自然科学基金面上项目

[74] X.Y. Ren, J.G. Qian, S.M. Huang, J.X. Zhang，The odd-valued chromatic polynomial of a signed graph，Discrete Mathematics 345 (2022) 113042.

[73] O.H.S. Lo，J.G. Qian, Hamiltonian cycles in 4-connected planar and projective planar triangulations with few 4-separators, SIAM J Disc Math 36(2) (2022), 1496–1501.

[72] M.Q. Wang, J.G. Qian, Degree sum condition for vertex disjoint 5-cycles, Discussiones Mathematicae，online, https://doi.org/10.7151/dmgt.2458

[71] C. Shi, P. Frankl, J.G. Qian, On non-empty cross-intersecting families, Combinatorica, online, DOI: 10.1007/s00493-021-4839-4

[70] T.L. Ma, J.G. Qian, C. Shi, Maximum Size of a Graph with Given Fractional Matching Number, The Electronic Journal of Combinatorics, 29(3) (2022), #P3.55

[69] M.Q. Wang, J.G. Qian, Ramsey Numbers for Complete Graphs Versus Generalized Fans, Graphs and Combinatorics, 38(2022), 186

[68] S.M. Huang, J.G. Qian, The Maximum Number of Stars in a Graph Without Linear Forest, Graphs and Combinatorics, 38(2022), 173

[67]. Wei Wang, Zhidan, Yan, Jianguo, Qian, Eigenvalues and chromatic number of a signed graph, Linear Algebra and Its Applications, 619(2021) 137-145.

[66]. W. Wang, L.H. Qiu, J.G. Qian, W. Wang, Generalized Spectral Characterization of Mixed Graphs, The Electronic Journal of Combinatorics 27(4) (2020), #P4.55.

[65]. M.Q. Wang, J.G. Qian, Rainbow vertex-pancyclicity of strongly edge-colored graphs, Discrete Mathematics 344 (2021) 112164

[64]. M.Q. Wang, J.G. Qian, An Ore-type condition for the existence of two disjoint cycles, Information Processing Letters ,159–160 (2020) 105957

[63]. W. Wang; J.G. Qian，A generalization of Noel–Reed–Wu Theorem to signed graphs, Discrete Mathematics, 343 (2020) 111833

[62]. W. Wang; J.G. Qian ; Z.D. Yan, Colorings versus list colorings of uniform hypergraphs, J Graph Theory. 95(2020) 384-397

[61]. W, Wang, J.G. Qian, T. Abe; Alon–Tarsi Number and Modulo Alon–Tarsi Number of Signed Graphs, Graphs and Combinatorics (2019) 35:1051–1064

[60]. X.Y. Ren, J.G. Qian, Flow polynomials of a signed graph, Electronic journal of combinatorics 26(3) (2019), #P3.37

[59]. W. Wang，J.G. Qian, Chromatic-choosability of hypergraphs with high chromatic number, Electronic Journal of Combinatorics, 2019, 26(1): #P1.5.

[58] Y.Chen, J.G. Qian, Inclusion–exclusion by ordering-free cancellation, Journal of Combinatorial Theory, Series A 162 (2019) 1–9

[57] G.L. Hao, J.G. Qian, Z.H. Xie，On the sum of the total domination numbers of a digraphs and its converse，Quaestiones Mathematicae，2018: 1–11

[56]. G.L. Hao, J.G. Qian; Bounds on the domination number of a digraph, J Comb Optim, 35 (1) (2018) 64–74.

[55] W. Wang; J.G. Qian ; Z.D. Yan, Towards a Version of Ohba’s Conjecture for Improper Colorings, Graphs and Combinatorics, 33 (2017) 489–501

[54] X.D. Chen, Y.P. Hou, J.G. Qian, Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius, Linear and multilinear algebra, 66 (2018) 919-936

[53]. G.L. Hao; J.G. Qian, On the Rainbow Domination Number of Digraphs, Graphs and combinatorics, 32(2016) 1903-1913

[52]. W. Wang, J.G. Qian, Z.D. Yan; When does the list-coloring function of a graph equal its chromatic polynomial，Journal of Combinatorial Theory, Ser.B, 122(2017)543-549

[51]. X.D. Chen, J.G. Qian; Bounds on the number of closed walks in a graph and its applications, Journal of inequalities and applications, 199, 2014, DOI: 10.1186/1029-242X-2014-199,

[50]. I. Gutman, B. Furtula, X.D. Chen, J.G. Qian, Graphs with Smallest Resolvent Estrada Indices, MATCH-Communications in mathematical and in computer chemstry，73(1): 267-270，2015

[49]. X.D. Chen, J.G. Qian; On Resolvent Estrada Index, MATCH-Communications in mathematical and in computer chemstry，73(1): 163-174，2015

[48]. G.L. Hao, J.G. Qian; On the sum of out-domination number and in-domination number of digraphs, Ars combinatorial, 119, 331 -337, 2015

[47]. I. Gutman, B. Furtula, X.D. Chen, J.G. Qian; Resolvent Estrada Index - Computational and Mathematical Studies, MATCH-Communications in mathematical and in computer chemstry，74(2): 431-440，2015

[46]. J.G. Qian; Enumeration of unlabeled uniform hypergraphs, Discrete Mathematics, Vol. 326, p66-74, 2014

[45]. K.C. Deng, J.G. Qian*; Enumerating stereo-isomers of tree-like polyinositols, Journal of Mathematical Chemistry, Vol. 52(6), p1581-1598, 2014, DOI: 10.1007/s10910-014-0338-9.

[44]. X.L. Zhang, J.G. Qian; L(p, q)-labeling and integer tension of a graph embedded on torus, Journal of Combinatorial Optimization, Vol: 31(1), 67-77, JAN 2016, DOI: 10.1007/s10878 -014-9714-4.

[43]. H.Z. Ren, F.J. Zhang, J.G. Qian; Monomer-dimer problem on random planar honeycomb lattice, Journal of Mathematical Physics, 55, 023304  (2014); Published online, http://dx.doi.org/10.1063/1.4866317.

[42]. J.G. Qian; Enumeration of unlabeled directed hypergraphs, The Electronic Journal of Combinatorics, Vol.20(1), #P46, 2013.

[41]. K.C. Deng, J.G. Qian, F.J. Zhang; Enumerating DNA polyhedral links, Journal of Mathematical Chemistry, Vol.51(5), p1329-1342, 2013.

[40] K.C. Deng, J.G. Qian, F.J. Zhang; Enumerating tree-like polyphenyl isomers, Journal of statistical mechanics-theory and experiment (JSTAT), (2012):P12018, DOI:10.1088/1742-5468/ 2012/12/ P12018

[39] X.L. Zhang, J.G. Qian; L(p, q)-Labeling and Integer Flow on Planar Graphs, The Computer Journal, 56(6)(2013):785-792, DOI:10. 1093/comjnl/ bxs159

[38] H.Z. Ren, F.J. Zhang, J.G. Qian, Dimer coverings on random multiple chains of planar honeycomb lattices, Journal of statistical mechanics-theory and experiment (JSTAT), (2012): P08002, DOI: 10.1088/ 1742-5468 /2012 /08/P08002

[37] X.D. Chen, J.G. Qian; Laplacian Spectral Radius and Maximum Degree of Trees with Perfect Matchings, Graphs and Combinatorics, 29(5) (2013):1249-1257, DOI: 10.1007/s00373-012-1205-8，

[36] K.C. Deng, J.G. Qian, F.J. Zhang; Enumerating the total colorings of a polyhedron and application to polyhedral links, Journal of mathematical chemistry, 50( 6)(2012): 1693-1705, DOI: 10.1007/s10910-012-9994-9

[35] X.D. Chen, J.G. Qian; Bounding the sum of powers of the Laplacian eigenvalues of graphs, Applied mathematics-a journal of Chinese universities, Ser. B, 26(2)(2011): 142-150,  DOI: 10.1007/s11766-011-2732-4

[34] J.G. Qian, Fuji Zhang; Counting the Cyclocized Polyphenacenes, Journal of computational chemistry，31(14)(2010): 2577-2584

[33] X.D. Chen, J.G. Qian; Conjugated trees with minimum general Randi¢ index, Discrete Applied Mathematics, 157 (2009)1379-1386

[32] J.G. Qian, K. Engel, W. Xu; A generalization of Sperner’s theorem and an application to graph orientations，Discrete Applied Mathematics，157 (9) (2009): 2170-2176

[31] M.R. Chen, J.G. Qian; On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes，Information Processing Letters，109(15) (2009) 828-831

[30] S. Li, F.J. Zhang J.G. Qian, Multi-hop all-to-all optical routings in Cartesian product networks, Information Processing Letters, 107 (2008) 252–256

[29] 林启法, 钱建国，给定最大匹配数的树的零阶广义Randi$\acute{c}$指标的界, hg8868官方网站学报(自然科学版), 2008, 47:153-157.

[28] 林启法 ， 钱建国, 给定最大匹配数的树的零阶广义Randic指标,《纯粹数学与应用数学》, 2010, 26 (2) :000339-344

[27] S. Li, C.L. Zhou, J.G. Qian; The load of kautz networks with shortest paths, International Symposium on Distributed Computing and Applications to Business, Engineering and Science, AUG 14-17, 2007 Yichang, PEOPLES R CHINA， DCABES 2007 Proceedings, Vols I and II: 332-333，2007

[26]. J.G. Qian, A. Dress, Y. Wang; On the dependence polynomial of a graph， European Journal of Combinatorics, 28 (1): 337-346 JAN 2007

[25]. M.R. Chen, J.G. Qian, Fault Tolerant Routings in Complete Multipartite Graph, Applied Mathematical Sciences, 2(1): 89-95, 2007.

[24] 冯惠英,钱建国, Routing Number of Digraphs and Product Graphs, 新疆大学学报（自然科学版）, 24(4): 407-412, 2007

[23]. J.G. Qian, Induced matching extendable graph powers, Graphs and Combinatorics, 22 (3): 391-398 NOV 2006

[22]. J.G. Qian, H. Lin; Graph colourings and solutions of systems of equations over finite fields, Discrete Mathematics, 306 (18): 2257-2262 SEP 28 2006

[21]. 徐伟(硕士研究生), 钱建国, 定向平均距离的界, 新疆大学学报, 第23期(增刊), 2006年8月, p44-49.

[20]. 原晋江, 王群, 钱建国, 没有独立点割图的平方图的导出匹配可扩性, 新疆大学学报, 第23期(增刊), 2006年8月, p31-35.

[19]. 冯惠英(硕士研究生), 钱建国, Minimum trees with respect to Hosoya-Wiener index, 数学研究, 第39卷, 2006年6月, p117-123

[18]. J.G. Qian, Degree complete graphs, Discrete mathematics, 306 (5): 533-537 MAR 28 2006

[17] J.G. Qian, F.J. Zhang; On the number of Kekule structures in capped zigzag nanotubes，Journal of Mathematical Chemistry, Vol.38, No.2, August (2005) 233-246.

[16] J.G. Qian F.J. Zhang; Kekule count in capped armchair nanotubes, Journal of Molecular Structure: THEOCHEM, 725（2005）223-230.

[15] J.G. Qian F.J. Zhang; On the number of solutions of some type equations in finite fields, Northeast. Math. J., 21(1)2005), 18-24.

[14] J.G. Qian F.J. Zhang; Expanding and forwarding parameters of product graphs, Discrete Applied Mathematics. Vol.136 (2004), 63-82.

[13] 林晓霞, 钱建国, 双弧竞赛图及其得分向量，hg8868官方网站学报(自然科学版), 第5期，(2004), 588-591.

[12 ] 钱建国, 浅谈算法实例在图论教学中的作用，莆田学院学报，2004年03期，70-71.

[11] The diameter of interchange graphs and the Brualdi's conjecture, 数学学报, 第45 卷, 第2 期 (2002), 411-416.

[10] 钱建国, 苗胜军, The S2NS digraphs and the cycle linear system of a digraph, 应用数学学报(英文版), 第18 卷, 第2 期, (2002), 333-340.

[9] 王艳, 钱建国, 线团 -收敛图(英文), 数学研究，2002年第4期，376-381

[8] 钱建国, 张福基, How to move the discs on the Tower of Hanoi, 运筹学学报（英文），第5卷, 第2 期, (2001)，21-32.

[7] 苏敏邦, 钱建国, On the number of perfect matchings in polygonal chains, 数学研究，第33卷, 第1期，(2000), 9-16.

[6] J.G. Qian, On the upper bound of the diameter of interchange graph, Discrete Mathematics, 195(1999), 277-285.

[5] J.G. Qian, Two classes of extreme graphs related to the maximum degree of an interchange graph, Austral. J. Combinatorics 19(1999), 3-10.

[4]. 钱建国, 变换图的一个结构定理, hg8868官方网站学报 (自然科学版), 第38卷, 第3期，(1999), 343-346.

[3] 钱建国, 向菊敏, Some properties of a class of interchange graphs, 高校应用数学学报（英文版）, Vol.13, no.4 (1998), 455-462.

[2] 钱建国, 广义变换图G(R, S) 的边连通度, hg8868官方网站学报(自然科学版), 第37卷, 第4期 (1998), 478 -482.

[1] 钱建国, 集合的基数与一一对应原理，青海师范大学学报(自然科学版), 第55卷, 第4期 (1998), 49 -50.

指导博士研究生10余人，硕士研究生20余人。