李泽鹏


【来源:信息科学与工程学院 | 发布日期:2018-02-08 】     【选择字号:
学习经历:
2004.09-20011.06 西北师范大学数学与信息科学学院本科、硕士
2011.09-2015.07 北京大学信息科学技术学院博士
 
 
工作经历:
2015.7-2017.6 北京大学博士后
2017.6-至今兰州大学副教授
 
教学及指导研究生情况:
 
 
发表论文及专著:
期刊论文:
1.ZepengLi, JinXu.On the trees with same signed edge and signed star dominationnumbers. International Journal of Computer Mathematics, 2018, https://doi.org/10.1080/00207160.2017.1396453.
2.ZepengLi,Enqiang Zhu,Zehui Shao, JinXu.NP-completeness of local colorings of graphs, Information Processing Letters, 2018,130:25–29.
3.ZepengLi,Zehui Shao, JinXu.Weak {2}-domination number of Cartesian productsof cycles,Journal of Combinatorial Optimization, 2018, 35(1): 75-85.
4.Zepeng Li, Jin Xu. A characterization of trees with equal independent domination and secure domination numbers, Information Processing Letters, 2017, 119:14-18.
5.ZepengLi,Zehui Shao, JinXu.On secure domination in trees, QuaestionesMathematicae, 2017, 40(1): 1-12.
6.ZepengLi,Enqiang Zhu,Zehui Shao, JinXu. A note on uniquely 3-colorable planar graphs. International Journal of Computer Mathematics, 2017, 94(5): 1028-1035.
7.ZepengLi,Enqiang Zhu,Zehui Shao, JinXu. Size of edge-critical uniquely 3-colorable planar graphs. Discrete Mathematics, 2016,339(4): 1242–1250.
8.ZepengLi,Enqiang Zhu,Zehui Shao, JinXu. On dominating sets of maximal outerplanar and planar graphs. Discrete Applied Mathematics, 2016, 198:164-169.
9.ZepengLi,Zehui Shao,Enqiang Zhu, JinXu. A note on local coloring of graphs. Information Processing Letters, 2015, 115: 302-305.
10.     Zehui Shao, Zepeng Li, Aljo?aPeperko, et al. Independent Rainbow Domination of Graphs. 2017. DOI 10.1007/s40840-017-0488-6
11.     Zehui Shao, Sandi Klav?ar, Zepeng Li, Pu Wu, Jin Xu. On the signed Roman k-domination: Complexity and thintorus graphs, Discrete Applied Mathematics, 2017, 233: 175–186.
12.     Zehui Shao, Fei Deng, Zepeng Li, AleksanderVesel, Graceful labelings of the generalized Petersen graphs, Communications in Combinatorics and Optimization, 2017, 2: 149-159.
13.     JinXu, Zepeng Li, Enqiang Zhu. On purely tree-colorable planar graphs. Information Processing Letters,2016, 116: 532–536.
14.     Xiang’en Chen, Zepeng Li. Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with Δ=9, 10, or 11. Information Processing Letters, 2015, 115(2):263-268.
15.     Xiang’en Chen, Zepeng Li. Vertex-distinguishing I-total colorings of graphs. UtilitasMathematica, 2014, 95: 319-327.
16.     Enqiang Zhu, Zepeng Li, Zehui Shao, Jin Xu, Chanjuan Liu. Tree-core and tree-coritivity of graphs. Information Processing Letters, 2015, 115(10):754-759.
17.     Enqiang Zhu, Zepeng Li, Zehui Shao, Jin Xu, Chanjuan Liu. Acyclic 3-coloring of generalized Petersen graphs. Journal of Combinatorial Optimization, 2016, 31(2):902-911.
18.     Enqiang Zhu, Zepeng Li, Zehui Shao, Jin Xu. Acyclically 4-colorable triangulations. Information Processing Letters, 2016, 116: 401-408.
19.     Tianyong Han, Zehui Shao, Enqiang Zhu, Zepeng Li, Fei Deng, Star coloring of Cartesian product of paths and cycles, ArsCombinatoria, 2016, 124: 65-84.
20.     李泽鹏,左杨,王宏宇. 基于社交网络结构的节点影响力度量方法, 电子学报, 2016, 44(12): 2967-2974.
21.     许进,李泽鹏,朱恩强,极大平面图理论研究进展,计算机学报,2015, 38(8): 1680-1704.
22.     Xiang’en Chen, Wenyu He, Zepeng Li, Bing Yao,Vertex-distinguishing IE-total Colorings of Cycles and Wheels, Communications in Mathematical Research, 2014, 30(3): 222-236.
23.     李泽鹏,王治文,陈祥恩,平面图的邻点可区别全染色,山东大学学报(理学版),2011,46(4):4-9.
24.     陈祥恩, 李泽鹏,姚兵,许进. 多重Mycielski图的点可区别全染色,兰州大学学报(自然科学版),2010,46(5):71-74.
 
会议论文:
1.       Zepeng Li, Jin Xu. Constructions of uniquely 3-colorable graphs[C]//IEEE First International Conference on Data Science in Cyberspace (DSC). IEEE Computer Society, Changsha, China, 2016:143-148.
2.       Enqiang Zhu, Fei Jiang, Zepeng Li, Zehui Shao, Jin Xu. On Adjacent Vertex-Distinguishing Total Chromatic Number of Generalized Petersen Graphs[C]// IEEE First International Conference on Data Science in Cyberspace. IEEE Computer Society, Changsha, China, 2016:230-234.
3.       XiangEn Chen, Zepeng Li, Bing Yao, et al. Adjacent-vertex-distinguishing total coloring of a type of generalized Halin graphs. Proceedings of the International Conference on Information Science and Control Engineering, 2012: 106-110.
 
研究方向:
图论与组合优化、复杂网络
 
项目成果:
主持项目:
1.  国家自然科学基金面上项目:基于核与核度理论的在线社交网络拓扑结构研究(61672050)
2.  中国博士后科学基金:图的控制集理论在无线传感器网络中的研究与应用(2016M591013)
 
邮箱:Lizp@lzu.edu.cn
办公地点:本部飞云楼308办公室
 

copyright © 2015 兰州大学信息科学与工程学院 All rights reserved