个人简历

个人简介
严政，博士，主要从事图论的教学与研究工作。2015年在日本茨城大学取得博士学位。主持国家自然科学基金一项。公开发表科研论文18余篇,被SCI、EI、ISTP三大检索收录13篇。近五年的教学情况及成果
1、讲授的主要课程
本科生课程：《概率论与数理统计》、《线性代数》、《近世代数》《初等数论》；
研究生课程：
2、承担的实践性教学任务
（1）指导了本科生毕业论文，共9人。

研究领域

图论"承担的学术研究课题
（1）图的参数与支撑树的研究，国家自然科学基金项目，2017～2019，主持人"

近期论文

(1)MikioKano,TomokiYamashitaandZhengYan,SpanningCaterpillarsHavingatmostkLeaves,ComputationalGeometryandGraphs,LNCS8296(Springer),pp.95-100,2013.(EI)
(2)MikioKanoandZhengYan,Spanningtreeswhosestemshaveatmostkleaves,ArsCombinatoria,Vol.117，pp.417–424,2014.(SCI)
(3)ZhengYan,ClosureforSpanningTreeswithk-EndedStems,OpenJournalofDiscreteMathematics,Vol.4，pp.55–59,2014.
(4)YoshimiEgawa,MikioKanoandZhengYan,Star-CycleFactorsofGraphs,DiscussionesMathematicaeGraphTheory,Vol.34,No.1,pp.193-198,2014.(SCI)
(5)ZhengYan,Strongf-starfactorsofgraphs,DiscussionesMathematicaeGraphTheory,35(3)(2015)475-482.(SCI)
(6)MikioKanoandZhengYan,Spanningtreeswhosestemsarespiders.GraphsandCombinatorics,31(2015)1883-1887.(SCI)
(7)YoshimiEgawa,MikioKanoandZhengYan,(1,f)-factorsofgraphswithoddproperty,GraphsandCombinatorics,32(1),pp.103-110,2016.(SCI)
(8)ZhengYan,Spanningtreeswhosestemshaveaboundednumberofbranchvertices.DiscussionesMathematicaeGraphTheory,2016,36:773-778.(SCI)
(9)MikioKanoandZhengYan,Spanningtreeswithboundeddegreesandleaves.DiscreteMathematic,2016，339（5）：1583-1586.(SCI)
(10)ZhengYan,Spanningk-endedtreesofclaw-freegraph.AdvancesandApplicationsinDiacreteMathematics,2016,17(4):453-459
(11)ZhengYan,Dominatingcycleofn-connectedgraphs.AdvancesandApplicationsinDiacreteMathematics,2017,18(1):1-11
(12)ZhengYan,Independencenumberandk-treesofgraph.GraphsandCombinatorics,Accepted.(SCI)