研究领域

  • 图论及其应用
  • 算法和复杂性分析
  • 网络科学

学术经历

学术经历

 

  • 2018年5月担任《Journal of Interconnection Networks 》客座编辑.
  • 2017年8月担任《Journal of Algebra, Combinatorics, Discrete Structures and Applications》编委.
  • 2014年6月毕业于南开大学组合数学中心,获得理学博士学位,导师为李学良教授.

 

工作经历

 

  • 2018年6月至今,青海师范大学计算机学院博士生导师.
  • 2016年9月至今,青海师范大学数学与统计学院硕士研究生导师.
  • 2017年12月至今,青海师范大学教授.
  • 2015年12月2017年11月,青海师范大学副教授、直聘教授.

 

行政经历

 

  • 2017年7月至今,青海师范大学数学与统计学院副院长.
  • 2017年4月至5月,青海师范大学数学与统计学院院长助理.

 

国际交流

 

  • 2017年7月至9月,美国Okaland大学访问学者,合作导师为Eddie Cheng教授.
  • 2015年1月至3月,加拿大Simon Frazer大学访问学者,合作导师为 Bojan Mohar教授.

 

学术会议与邀请报告

 

  • Oganizer of 2018 International Conference on Graphs, Artificial Intelligence and Complex Networks, Xining, Qinghai, China, 28/7/2018-29/7/2018.
  • Oganizer of the third International Symposium on the Frontier of Graph Theory, Xining, Qinghai, China, 25/4/2018.
  • Invited Talk: Steiner Tree Packing Problem and Generalized Connectivity, Mathematics Forum, School of Mathematics and Statistics, Lanzhou University, China, 25/11/2017-26/11/2017.
  • Invited Talk: Steiner Distance in Graphs, The 15th Annual Meeting of the China Society for Industrial and Applied Mathematics (CSIAM 2017), Qingdao, Shandong, China, 13/10/2017-15/10/2017.
  • Oganizer of 2017 International Symposium on the Frontier of Graph Theory, Xining, Qinghai, China, 3/6/2017-4/6/2017.
  • Program Committee member, Track on Graphs and Interconnection Networks, The 14th International Symposium on Pervasive Systems, Algorithms, and Networks (I-SPAN 2017), Exeter, Devon, UK, 21/7/2017-23/7/2017.
  • Oganizer of 2016 International Symposium on Structural Graph Theory, Xining, Qinghai, China, 29/10/2016-2/11/2016. Invited Talk: Steiner Tree Packing Problem and Generalized Connectivity.

     

教学科研奖励

人才计划

 

  • 2017年12月入选青海省自然科学与工程技术学科带头人.
  • 2017年3月入选青海省“优秀专业技术人才”.
  • 2017年3月入选青海省“135高层次人才培养工程"拔尖学科带头人.
  • 2016年12月首批入选青海省“高端创新人才千人计划"拔尖人才.

 

荣誉称号

 

  • 2018年8月被授予青海省“优秀专家”荣誉称号.
  • 2014年6月被南开大学授予“南开大学研究生优秀毕业生”荣誉称号.

 

科研奖励

 

  • 2013年10月获得南开大学研究生优秀奖学金一等奖.

 

教学荣誉

 

  • 2016年8月获得第三届全国青年教师教学竞赛三等奖.
  • 2017年12月,景琦同学荣获全国高等学校第五届师范生教学技能大赛三等奖(指导教师).

 

社会奖励

 

  • 2017年5月荣获"青海青年五四奖章".

科研项目

科研和会议项目(国家级)

 

  • 2017年1月-2019年12月,主持国家自然科学基金青年项目:斯坦纳树填装数猜想与图的树连通度(19万),批准号:11601254.
  • 2016年1月-2018年12月,主持国家自然科学基金应急管理项目:图的广义连通度和斯坦纳距离(15万),批准号:11551001.
  • 2014年7月-2017年12月,参与国家自然科学基金项目: 图的谱特征和色性问题及其关系研究(38万), 批准号:11461054.
  • 2013年1月-2017年12月,参与国家自然科学基金面上项目:图的彩虹连通与广义连通度(55万),批准号:11371205.
  • 2012年1月-2015年12月,参与国家自然科学基金项目:图的代数性质与拓扑指标关系研究(50万),批准号:11161037.
  • 2011年7月-2013年12月,参与青海省自然科学基金项目:代数图论与图的拓扑参数理论研究(6万),批准号:2011-Z-907.

 

  • 2018年1月-2018年12月,主持国家外专局2018年度教科文卫重点引智项目:结构图论若干问题及其应用(15万), 批准号:20176300070.
  • 2017年1月-2017年12月,主持国家外专局2017年度教科文卫重点引智项目:结构图论若干问题及其应用(8万), 批准号:20176300053.
  • 2016年1月-2016年12月,主持国家外专局2016年度教科文卫重点引智项目:斯坦纳树结构参数研究(8万), 批准号:20166300027 .

 

  • 2018年1月-2018年12月,负责国家天元数学西北中心前沿学术项目:2018图论、人工智能与复杂网络国际研讨会(8万),批准号:QY201808.
  • 2018年1月-2018年12月,负责国家天元数学西北中心前沿学术项目:数学与人工智能文化传播--青藏高原大师论道(8万),批准号:QY201812.

 

科研和会议项目(省部级)

 

  • 2016年6月-2019年12月,主持青海省自然科学基金青年项目:图的斯坦纳直径与彩虹连通度(10万),批准号:2016-ZJ-948Q.
  • 2016年1月-2017年12月,主持青海师范大学校级项目:图的斯坦纳维纳指标(2万).
  • 2014年7月-2017年12月,参与青海省自然科学基金项目面上项目: 图的连通性与代数性质研究(20万), 批准号:2014-ZJ-907.
  • 2011年7月-2013年12月,参与青海省自然科学基金项目:代数图论与图的拓扑参数理论研究(6万),批准号:2011-Z-907.

 

教学项目

 

  • 2016年1月-2017年12月,参与《组合数学》研究生精品课程(2万).
  • 2016年1月-2017年12月,参与《图论及其应用》研究生精品课程(2万).

 

其它项目

 

  • 2016年7月-2017年7月,指导本科生创新项目:斯坦纳结构参数研究(1万).

科研成果

Books

 

  • Generalized Connectivity of Graphs, Springer Briefs in Mathematics, Springer, Switzerland, 2016. (with Xueliang Li)
  • Nordhaus-Gaddum Type Results in Chemical Graph Theory, Bounds in Chemical Graph Theory--Advances (eds. I. Gutman, B. Furtula, K.C. Das, E. Milovanovic, I. Milovanovic, Univ. Kragujevac, Kragujevac, 2017, pp. 3-127.

 

Survey Papers

 

  • Steiner distance in graphs-A survey, arXiv:1708.05779 [math.CO] 2017.
  • A survey on the generalized connectivity of graphs, arXiv:1207.1838 [math.CO] 2012. (with Xueliang Li)

 

Papers

 

Submittted Papers

 

  • Fractional matching preclusion for generalized augmented cubes, submitted. (with Tianlong Ma, Eddie Cheng, Christopher Melekian)
  • Fractional matching preclusion for arrangement graphs, submitted. (with Tianlong Ma, Eddie Cheng, Jinling Wang)
  • Fractional matching preclusion for (n,k)-star graphs, submitted. (with Tianlong Ma, Eddie Cheng, Jinling Wang)
  • Fractional matching preclusion for (burnt) pancake graphs, submitted. (with Tianlong Ma, Eddie Cheng, Christopher Melekian)
  • Vertex Matching preclusion number of graphs, submitted. (with Ran Gu, Zhao Wang, Eddie Cheng, Christopher Melekian)
  • Matching preclusion number of graphs, submitted. (with Zhao Wang, Eddie Cheng, Jinyu Zou)
  • Nordhaus-Guddum type results for the conflict-free number of graphs, submitted. (with Hong Chang, Zhong Huang, Xueliang Li, Haixing Zhao)
  • Generalized (edge-)connectivity of join, corona and cluster, submitted. (with Zhao Wang, Bo Deng, Haixing Zhao)
  • Generalized connectivity of random graphs, submitted. (with Ran Gu)
  • Path connectivity of random graphs, submitted. (with Ran Gu, Hongjian Lai)
  • Gallai-Ramsey number for book graphs, submitted. (with Jinyu Zou, Zhao Wang, Colton Maganant, Chengfu Ye)
  • Gallai-Ramsey number for fan graphs, submitted. (with Jinyu Zou, Zhao Wang, Colton Maganant)
  • Gallai-Ramsey number for a class of unicyclic graphs, submitted. (with Zhao Wang, Jinyu Zou, Colton Maganant)
  • Nordhaus-Guddum type results for the Steiner Gutman index of graphs, submitted. (with Zhao Wang, Kinkar Chandra Das)
  • Steiner diameter, maximum degree and size, submitted. (with Zhao Wang)
  • Steiner 3-diameter, maximum degree and size, submitted.
  • Linear k-arboricity of Caylay graphs on Abelian groups with given degree, submitted. (with Nan Jia, Zhao Wang, Eddie Cheng)
  • Constructing internally disjoint pendant Steiner trees in lexicographic product networks, submitted (with Christopher Melekian, Eddie Cheng)

 

Accepted Papers

 

  • Steiner distance in product networks, Discrete Math. Theor. Comput. Sci., in press (with Eddie Cheng, Zhao Wang) (SCI)
  • Invulnerability of planar two-tree networks, Theor. Comput. Sci, in press (with Yuzhi Xiao, Haixing Zhao, ) (SCI)
  • Matching preclusion number in product networks, Theor. Comput. Sci., in press (with Zhao Wang, Eddie Cheng, Christopher Melekian) (SCI)
  • Proper coloring connectivity of graph products, Bull. Malays. Math. Sci. Soc., in press (with Fengnan Yanling, Zhao Wang, Chengfu Ye) (SCI)
  • A result on the 3-generalized connectivity of a graph and its line graph, Bull. Malays. Math. Sci. Soc., in press (with Yinkui Li) (SCI)
  • Conflict-free vertex-connection of graphs, Discuss. Math. Graph Theory, in press (with Xueliang Li, Xiaoyu Zhu, Yingying Zhang, S. Jendrol) (SCI)
  • Steiner distance in join, corona, cluster, and threshold graphs, accepted by J. Inf. Sci. Eng. (with Zhao Wang, Christopher Melekian, Eddie Cheng) (SCI)
  • Steiner degree distance of two graph products, An. Sti. Univer. Ovid. Co.-Seria Mat., in press (with Zhao Wang, Kinkar Chandra Das) (SCI)
  • A [2,2s]-factor in the square of graphs, J. Combin. Math. Combin. Comput. (with Shumin Zhang) (EI)

 

Published Papers

 

2018

 

  • Strong matching preclusion number of graphs, Theor. Comput. Sci. 713 (2018), 11-20. (with Zhao Wang, Eddie Cheng, Christopher Melekian) (SCI)
  • Steiner Gutman index, MATCH Commun. Math. Comput. Chem. 79 (2018), 779-794. (with Kinkar Chandra Das) (SCI)
  • Inverse problem on the Steiner Wiener index, Discuss. Math. Graph Theory 38 (2018), 83-95. (with Xueliang Li and Ivan Gutman) (SCI)
  • Graphs with given k-independence number, Utilitas Math. 106 (2018), 51-64. (with Junliang Cai, Zhao Wang) (SCI)
  • Constructing internally disjoint pendant Steiner trees in Cartesian product networks, Australasian J. Combin. 70(1)(2018), 28-51. (EI)
  • Steiner 4-diameter of a graph, JOIN 18 (2018), 1850002. (with Zhao Wang, Hengzhe Li, Chengfu Ye) (EI)
  • The k-independent number of graph products, Ars Math. Contemp. 1 (2018), P01. (with Eddie Cheng, Zhao Wang, Zhiwei Guo)
  • A note on the Steiner (n-k)-diameter of a graph, Int. J. Comput. Math.: CST 3(1) (2018), 41-46. (with Eddie Cheng, Christopher Melekian)

 

2017

 

  • Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs, Discrete Appl. Math. 219(2017) 167-175. (with Zhao Wang, Ivan Gutman, He Li) (SCI)
  • A solution to a conjecture on the generalized connectivity of graphs, J. Combin. Optim. 33(1)(2017), 275-282. (with Lily Chen, Xueliang Li, Mengmeng Liu) (SCI)
  • Steiner degree distance, MATCH Commun. Math. Comput. Chem. 78(1)(2017), 221-230. (with Zhao Wang, Ivan Gutman, Antoaneta Klobucar) (SCI)
  • Order trees by the number of subtrees, Int. J. Comput. Math. 94(2)(2017), 372-385. (with Yuzhi Xiao, Haixing Zhao, and Zhen Yan) (SCI,EI)
  • Constructing edge-disjoint Steiner paths in lexicographic product graphs, Appl. Math. Comput. 308(1)(2017), 1-10. (SCI)
  • The Steiner diameter of a graph, Bull. Iran. Math. Soc. 43(2)(2017), 439-454. (SCI)
  • Conflict-free connection numbers of line graphs, Lecture Notes in Computer Science Vol. 10627, Proceedings of COCOA 2017, Shanghai, China (SCI)
  • Steiner Wiener index and connectivity of graphs, Utilitas Math. 102(2017), 51-57. (with Zhao Wang, Yuzhi Xiao, Chengfu Ye) (SCI)hnd149r
  • Super edge-connectivity of strong product graphs, JOIN 17(2) (2017) 1750007. (with Zhao Wang, Chengfu Ye, Haixing Zhao) (EI)
  • On the skew energy of oriented unicyclic digraphs, J. Combin. Math. Combin. Comput. 103(2017), 3-14. (with Zhao Wang, Teng Ma, and Chengfu Ye) (EI)
  • Oriented graphs with minimal skew energy, J. Combin. Math. Combin. Comput. 103(2017), 147-157. (with Yubo Gao, Zhao Wang, and Chengfu Ye) (EI)


2016

 

  • Path connectivity of lexicographical product graphs, Int.J. Comput. Math. 93(1)(2016), 27-39. (SCI,EI)
  • The vertex-rainbow index of a graph, Discuss. Math. Graph Theory 36(3)(2016), 669-681. (SCI)
  • Rainbow vertex-connection and graph products, Int. J. Comput. Math.93(7)(2016), 1078-1092. (with Fengnan Yanling, Zhao Wang, and Chengfu Ye) (SCI,EI)
  • On the equitable vertex arboricity of complete bipartite graphs, Utilitas Math. 99(2016), 403-411. (with Zhiwei Guo, Haixing Zhao, and Chengfu Ye) (SCI)
  • A small-world network derived from the deterministic uniform recursive tree by line graph operation, J. Phys. A: Math. Theor. 49(2016), 115101 (with Pengfeng Hou, Haixing Zhao, and Zhao Wang) (SCI)
  • The Steiner Wiener index of a graph, Discuss. Math. Graph Theory 36(2)(2016), 455-465. (with Xueliang Li and Ivan Gutman) (SCI)
  • Steiner Wiener index of graph products,Trans. Combin. 5(3)(2016), 39-50. (with Zhao Wang and Ivan Gutman) (SCI)
  • The fifth coefficient of adjoint polynomial and a new invariant, Ars Combin. 128(2016), 83-102. (with Chengfu Ye) (SCI)
  • Graphs with large generalized (edge-)connectivity, Discuss. Math. Graph Theory 36 (2016) 931-958. (with Xueliang Li) (SCI)
  • Line k-arboricity in product networks, JOIN 16(3,4)(2016), 1650008. (with Zhiwei Guo, Nan Jia, He Li) (EI)


2015

  • On extremal graphs with at most l internally disjoint Steiner trees connecting any n-1 vertices, Graphs Combin.31(6)(2015), 2231-2259. (with Xueliang Li) (SCI)
  • Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs, Discrete Appl. Math. 185(2015),102-112. (with Xueliang Li) (SCI,EI)
  • Note on the spanning-tree packing number of lexicographic product graphs, Discrete Math. 338(5,6)(2015), 669-673. (with Hengzhe Li, Xueliang Li, and Jun Yue) (SCI)
  • More on a conjecture about tricyclic graphs with maximal energy, MATCH Commun. Math. Comput. Chem. 73(1)(2015), 11-26. (with Xueliang Li and Meiqin Wei) (SCI)
  • The minimal size of a graph with given generalized 3-edge-connectivity, Ars Combin. 118(2015), 63-72. (with Xueliang Li) (SCI)
  • On the equitable vertex arboricity of complete tripartite graphs, Inform. Proc. Lett.  115(2015), 977-982. (with Zhiwei Guo and Haixing Zhao) (SCI)
  • Searching (near) optimal codes, Lecture Notes in Computer Science(LNCS) Vol.9486 (Proceedings of COCOA2015, Houston, USA)(with Xueliang Li, Meiqin Wei, and Ruihu Li) (SCI)

 

2014

 

  • The generalized 3-connectivity of lexigraphical product graphs,Discrete Math. Theor. Comput. Sci. 16(1)(2014), 339-354.(with Xueliang Li) (SCI,EI)
  • On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices, Bull. Malays. Math. Sci. Soc. (2)37(3)(2014), 747-756. (with Hengzhe Li and Xueliang Li) (SCI)
  • On the generalized (edge-)connectivity of graphs, Australasian J. Combin. 58(2)(2014), 304-319. (with Xueliang Li and Yuefang Sun)
  • The strong rainbow vertex-connection of graphs, Utilitus Math. 93(2014), 213-223. (with Xueliang Li and Yongtang Shi) (SCI)
  • Note on the generalized connectivity, Ars Combin. 114(2014), 193-202. (with Hengzhe Li, Xueliang Li, and Yuefang Sun) (SCI)

 

学术与社会兼职

学术兼职

 

  • 美国《Mathematical Reviews》评论员.
  • 应邀为以下学术期刊审稿:Diascrete Mathematics,Discrete Applied Mathematics,Journal of Combinatorial Optimization,JDiscussiones Mathematicae Graph TheoryBulletin of the Malaysian Mathematical Sciences Society, Acta Mathematicae Applicatae Sinica (English Series) , International Journal of Computer Mathematics, Applied Mathematics and Computation,Czechoslovak Mathematical Journal, Advance in Mathematics,PLOS ONE, Ars Combinatoria, Graphs and Combinatorics.
  • 青海师范大学学位委员会委员.

 

社会兼职

 

  • 青海省政协十二届委员会委员.
  • 青海省青年联合会第十届委员会委员.
  • 民革青海省省委第八届委员会委员.
  • 青海省监察厅特邀监察员.

 

研究生培养

 

  • 学术型硕士研究生: 葛惠芬 (2016级) 韩 萍 (2017级) 朱 波(2018级) 张双双(2018级) 张 鹤(2018级)
  • 专业型硕士研究生:解晓莉 (2018级)

 

邀请国际专家

 

  • Miklós Simonovits ,Hungarian Academy of Sciences, 28/10/2016-4/11/2016, Talk Title: Various applications of the Stability method in extremal graph theory and related areas;
  • 林宇清, University of Newcastle, 28/10/2016-2/11/2016, Talk Title: Factorization of Regular Graphs;
  • 刘九强, Eastern Michigan University, USA, 28/10/2016-30/10/2016,Talk Title: Cross t-intersecting Families in Set Systems;
  • 傅恒霖,台湾交通大学,28/10/2016-4/11/2016, Talk Title: Multicolored Subgraphs in Properly Edge-colored Graphs;
  • 高金美,台湾淡江大学,28/10/2016-4/11/2016, Talk Title: Graph Decomposition;
  • Henry Liu, 中南大学,8/10/2016-4/11/2016, Talk Title: Connected Subgraphs in Edge-Coloured Graphs;
  • Colton Magnant, Georgia Southern University, USA, 8/10/2016-4/11/2016,Talk Title: Gallai-Ramsey numbers for finding either a rainbow triangle or some small monochromatic subgraphs; /7/2017-31/7/2017, Talk Title:Gallai-Ramsey numbers - General bounds and sharp cases ;
  • 郁星星,Georgia Institute of Technology, USA, 8/10/2017-4/11/2017, Talk Title: On judicious bipartitions of graphs; 9/7/2017-30/7/2017, Talk Title:Problems related to the Four Color Theorem ;
  • 宋梓霞, University of Central Florida, USA, 8/10/2017-4/11/2017, Talk Title: On saturated graphs; 29/7/2017-30/7/2017, Talk Title: Multicolor Gallai-Ramsey numbers of cycles;
  • Ioannis Manoussakis, University Paris South, France, 8/10/2017-4/11/2017, Talk Title: Algorithmic and structural results on the existence of tropical subgraphs in vertex-colored graphs;
  • Kinkar Chandra Das, Sungkyunkwan University, USA, 8/10/2017-4/1/2018, Talk Title: Comparison between topological indecies of graphs;
  • Alexander Anatolievich Ivanov, Imperial College London, UK, 24/4/2018-27/4/2018, Talk Title: The Mathieu Groups;
  • Elena Konstantinova, Novosibirsk State University, 24/4/2018-27/4/2018, Talk Title: Chromatic properties of Cayley graphs;
  • Julien Bensmail, University of Côte d’Azur, France, 24/4/2018-27/4/2018, Talk Title: On augmenting matchings via bounded-length augmentations;
  • 罗荣,West Virginia University, USA,24/4/2018-27/4/2018, Talk Title: Edge coloring of simple graphs on surfaces;
  • Johanne Cohen, French National Centre for Scientific Research, France, 24/5/2018-27/5/2018, Talk Title: Self-stabilizing algorithms for matching;
  • Evelyne Flandrin, University Paris South, France, 24/5/2018-27/5/2018, Talk Title: Cycles in graphs and in prisms of graphs;
  • Antoine Lobstein, French National Centre for Scientific Research, France, 24/5/2018-27/5/2018, Talk Title: On codes identifying vertices in graphs;
  • Ioannis Manoussakis, University Paris South, France, 24/5/2018-27/5/2018, Talk Title: Subgraphs with specified color properties in vertex- or edge-colored graphs;
  • 李皓, French National Centre for Scientific Research, France, 24/5/2018-27/5/2018, Talk Title: On pancyclic;
  • 陈冠涛,Georgia State University ,USA,25/7/2018-1/8/2018,Talk Title:Progress on Goldberg’s conjecture ;
  • Ingo Schiermeyer, Freiberg University of Mining and Technology,Germany, 27/7/2018-30/7/2018, Talk Title: Gallai Ramsey number for K_4 and K_5 ;
  • Hajo Broersma,University of Twente ,Netherlands, 27/7/2018-5/8/2018, Talk Title: The power of closure operations ;
  • 赖虹建,West Virginia University, USA,26/7/2018-31/7/2018,Talk Title:Some progress on the group connectivity and modular orientations of graphs ;
  • Akira Saito,Nihon University,Japan, 29/7/2018-30/7/2018, Talk Title: Hamiltonian bipartite graphs in dense graphs ;
  • 卫兵,University of Mississippi , USA,25/7/2018-1/8/2018, Talk Title: Independent bondage number of a graph ;
  • 周向前,Wright State University ,USA,25/7/2018-31/7/2018, Talk Title:Induction for 4-connected matroids and graphs ;
  • Kenta Ozeki ,Yokohama National University ,Japan, 27/7/2018-31/7/2018, Talk Title:Every 4-connected graph with crossing number 2 is hamiltonian ;
  • Shinya Fujita, Yokohama City University ,Japan, 27/7/2018-31/7/2018, Talk Title: Some recent results on safe sets in graphs;
  • 吴方向,University of Saskatchewan, Canada , 20/6/2018-22/6/2018, Talk Title:Computational Network Biology ;

 

培训学习

 

  • 青海省第十二届政协委员培训班,全国政协干部培训中心,北戴河,9/4/2018-15/4/2018.
  • 第十四期民革中青年干部培训班,中央社会主义学院, 北京,10/4/2017-21/4/2017.
  • 青海省高层次人才国情研修班,海北州委党校,西海镇,海北州, 2016.