严政

 

一、基本信息

姓 名

 

最终学历

 

职 称

 副教授

职 务

学 位

  

电子邮件

yanzhenghubei@163.com

通信地址

湖北省荆州市betway必威

邮政编码

434023

研究方向

图论

社会职务

二、个人简介

严政,博士,主要从事图论的教学与研究工作。2015年在日本茨城大学取得博士学位。主持国家自然科学基金一项。公开发表科研论文18余篇 , SCI EI ISTP三大检索收录13篇。

三、 近五年的教学情况及成果
1、讲授的主要课程
 
本科生课程:《概率论与数理统计》、《线性代数》、《近世代数》《初等数论》;

研究生课程:

2、承担的实践性教学任务
1)指导了本科生毕业论文,共9人。

3. 主持及参与的教学研究项目

四、 近几年的学术研究
1、承担的学术研究课题
1)图的参数与支撑树的研究,国家自然科学基金项目,20172019,主持人
2、发表的学术论文

(1) Mikio Kano, Tomoki Yamashita and Zheng Yan, Spanning Caterpillars Having at most k Leaves, Computational Geometry and Graphs, LNCS 8296 (Springer) ,pp.95-100, 2013.(EI)

(2) Mikio Kano and Zheng Yan, Spanning trees whose stems have at most k leaves, Ars Combinatoria,Vol. 117pp. 417 – 424, 2014. (SCI)

(3) Zheng Yan, Closure for Spanning Trees with k-Ended Stems, Open Journal of Discrete Mathematics, Vol. 4pp.55 – 59, 2014.

(4) Yoshimi Egawa, Mikio Kano and Zheng Yan, Star-Cycle Factors of Graphs,   DiscussionesMathematicae Graph Theory, Vol. 34 ,No. 1, pp.193-198, 2014. (SCI)

(5) Zheng Yan, Strong f-star factors of graphs, DiscussionesMathematicae Graph Theory, 35(3) (2015) 475-482. (SCI)

(6) Mikio Kano and Zheng Yan, Spanning trees whose stems are spiders. Graphs and Combinatorics, 31(2015)1883-1887.(SCI)

(7) Yoshimi Egawa, Mikio Kano and Zheng Yan, (1,f)-factors of graphs with odd property, Graphs and Combinatorics,32(1),pp.103-110, 2016. (SCI)

(8) Zheng Yan,Spanning trees whose stems have a bounded number of branch vertices. Discussiones Mathematicae Graph Theory, 2016,36:773-778. (SCI)

(9) Mikio Kano and Zheng Yan, Spanning trees with bounded degrees and leaves. Discrete Mathematic, 20163395):1583-1586.(SCI)

(10) Zheng Yan, Spanning k-ended trees of claw-free graph. Advances and Applications in Diacrete Mathematics,2016,17(4):453-459

(11) Zheng Yan, Dominating cycle of n-connected graphs. Advances and Applications in Diacrete Mathematics, 2017,18(1):1-11

(12) Zheng Yan, Independence number and k-trees of graph. Graphs and Combinatorics, Accepted.(SCI)

上一篇:吴海涛
下一篇:朱智慧