吕大梅，女，1976年11月生，江苏海安人，理学硕士。

一、学习进修经历： 1994.09－1998.06 苏州大学 数学教育 学士 2004.09－2007.01 东南大学 运筹学与控制论 硕士研究生 二、教学工作经历： 1998.07-2004.05 南通师范学院数学系，教师 2004.06-至今 南通大学理学院，教师 主讲课程：数学分析，复变函数，线性代数，高等数学 三、教学科研成果： 1.主持江苏省自然科学青年基金项目：边路替换图的距离2标号与距离2圆标号问题

图论及其应用。

[1]Damei Lv. L(2,1)-labelings of edge-path-replacement of a graph[J]. Comb Optim, 2013,26:385–392. [2]Damei Lv and Nianfeng Lin.L(d,1)-labelings of edge-path-replacement of a graph[J]. Comb Optim,2013,26:819–831 . [3]Damei Lv and Wensong Lin.L(j,k)-labelings of Cartesian products of three complete graphs[J]. Ars Combinatoria,2015,117:97-116. [4]Damei Lv, Juan Du and Nianfeng Lin. Nordhaus-Gaddum-type results for path covering and L(2,1)-labeling numbers[J].J.Comb. Optimization,2015,29(2):502-510. [5]Lv DM and Sun JP. L(2,1)-labelings of the edge-multiplicity-paths- replacement of a graph[J].Comb Optim,2016,31:396–404. [6]D. M. Lv and W.S. Lin. 1,2,3-Conjecture and 1,2-Conjecture of the edge- multiplicity- paths-replacements[J]. Zhejiang University(Science Edition),2016,43(6): 669-672. [7]Damei Lv. Distance two labelings and (total-)neighbor-distinguishing colorings of the edge-multiplicity-paths- replacements[J]. Ars Combinatoria,2017(131):143-159 [8]D.M. Lv, D. M. Yan and N.F. Lin; L(j,k)-labelings of mobius ladder; J. Zhejiang university (science edition).38(3):256-261,2011 [9]D.M. Lv, W.S. Lin and Z.M. Song, On L(2,1)-labelings of graphs with conectiving number k, J. Jilin university(science edition).45 : 555-561,2007 [10]D.M. Lv and W.S. Lin；Distance two labelings of Cartesian products of complete graphs; Ars Combinatoria,104:33-40, 2012 [11]D.M. Lv and W.S. Lin,L(2,1)-circular labelings of Cartesian products of complete graphs; J. of Mathematical Research and Exposition,29(1):91-98,2009 [12]Juan Du and Damei Lv, L(d,1)-labelings of the edge-multiplicity-paths- replacements. J. Ars Combinatoria,131:143-159, 2017 .