厦门大学数学学院师资队伍
School of Mathematical Sciences Xiamen University
师资队伍

男,1963年6月生,籍贯浙江嵊州,厦门大学数学科学学院教授,博士生导师,主要从事图论应用(网络拓扑结构设计与优化、化学图论)及组合计数方面的研究,现任中国组合数学与图论专业委员会委员,中国运筹学会图论分会常务理事,福建省运筹学会副理事长,美国数学会《数学评论》评论员,发表评论 40 余篇; 在J. Combin. Theory, Ser A 及J. Combin. Theory, Ser B等专业期刊上发表学术论文 60 余篇; 主持和参加多项国家面上及重点基金项目。

 

发表的部分论文(publications):

[48]. W, Wang, J.G. Qian, T. Abe; AlonTarsi Number and Modulo AlonTarsi Number of Signed Graphs, Graphs and Combinatorics (2019) 35:10511064[48]. X.Y. Ren, J.G. Qian, Flow polynomials of a signed graph, The electronic journal of combinatorics 26(3) (2019), #P3.37

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

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

[45] 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.

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

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

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

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

[40]. 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.

[39]. 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.

[38]. 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)(2015) 267-270.

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

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

[35]. 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)(2015) 431-440.

[34]. J.G. Qian; Enumeration of unlabeled uniform hypergraphs, Discrete Mathematics, 326(2014) 66-74.

[33]. K.C. Deng, J.G. Qian*; Enumerating stereo-isomers of tree-like polyinositols, Journal of Mathematical Chemistry, Vol. 52(6)(2014) 1581-1598.

[32]. X.L. Zhang, J.G. Qian*; L(p, q)-labeling and integer tension of a graph embedded on torus, Journal of Combinatorial Optimization, 31(1)(2016) 67-77.

[31]. H.Z. Ren, F.J. Zhang, J.G. Qian*; Monomer-dimer problem on random planar honeycomb lattice, Journal of Mathematical Physics, 55(2014)023304.

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

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

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

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

[26] 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.

[25] 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.

[24] 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.

[23] 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.

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

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

[20] 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.

[19] 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.

[18] 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

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

[16]  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,DCABES 2007 Proceedings, Vols I and II, 332-333,2007.

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

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

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

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

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

[10]  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.

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

[8] 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.

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

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

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

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

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

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

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

 
 
 
简介
 
系别:
数学与应用数学系
办公室:637
教师:钱建国
职称:教授
职务:==空==
Phone:2580669
Email:
jgqian@xmu.edu.cn
研究方向:
图论,组合计数(graph theory,combinatorial enumeration