基本信息
職務職稱:副教授、碩導
電子郵件:damei@ntu.edu.cn
部門:公共教學部
呂大梅,女。1976年11月出生,江蘇海安人。主要研究方向:圖論及其應用。參與國家自然科學基金2項,主持江蘇省自然科學青年基金1項,指導江蘇省高等學校大學生實踐創新訓練計劃項目1項。在國内外發表學術論文二十多篇,被SCI 檢索十多篇。
1. 國家自然科學基金委員會,面上項目,10671033,圖的圓着色與距離二标号問題,2007-01至2008-12,結題,排名第6
2. 國家自然科學基金委員會,面上項目,11371207,廣義柯克曼方和t-設計的構造及其應用研究,2014-01至2017-12,結題,排名第5
3. 江蘇省自然科學青年基金項目,BK20140424,邊路替換圖的距離2标号與距離2圓标号問題,2014-07至2017-06,20萬元,結題,主持
4. 江蘇省高等學校大學生實踐創新訓練計劃項目,2012JSSPITP1555,局部邊-路替換圖的距離2标号問題,2012.01至2013.03,結題,指導
[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).2021, 38(3):256-261.
[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). 2007,45 : 555-561.
[10] D.M. Lv and W.S. Lin;Distance two labelings of Cartesian products of complete graphs; Ars Combinatoria,2012,104:33-40.
[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 ,2019, 29(1):91-98.
[12] Juan Du and Damei Lv, L(d,1)-labelings of the edge-multiplicity-paths- replacements. J. Ars Combinatoria, 2017,131:407-424 .
[13] D.M. Lv and W.S. Lin;Ciucular chromatic number and edge-path replacement graph; Ars Combinatoria,2019,144: 237-248.
[14] D.M. Lv and W.S. Lin. n-fold-L(d,1)-labelings of the edge-multiplicity-paths- replacement of a graph[J]; Ars Combinatoria,2019,146:341-360 .
[15] D.M. Lv and Nianfeng Lin. L(2,1)-circular-labelings of the edge-path- replacements[J];Ars Combinatoria, 2021(1):23-30.
[16] Damei Lv and Wensong Lin. L(2,1)-circular labelings of Cartesian products of complete graphs[J]; 數學研究與評論2009,29(1):91-98(2009年獲得南通市科技論文優秀論文獎).
[17] Lv Damei Li Haiping Yi Dan Zhang Ke and Yi Du. (d,1)-total labeling of Mobius ladder[J];浙江大學學報(理學版)2013,4: 138-142.
[18] Damei Lv, Yan Dongmei and Lin Nianfeng. L(j,k)-labelings of mobius ladder[J];浙江大學學報(理學版)2011,38(3):256-261.
[19] 呂大梅,馮瑞華. N-G型的代數連通度的界[J];浙江大學學報(理學版)2012,39(2):130-134.
[20] 呂大梅,呂嘉鈞.單圈圖的N-G型的代數連通度的界[J];浙江大學學報(理學版)2006,33(4):368-371.
[21] 李俊峰,呂大梅.點接手镯圖的L(1,1,1)-标号[J].數學的實踐與認識,2022,52(9):271-275.
[22] 劉躍芹,呂大梅.豎梯的局部邊路替換圖的L(d,1,1)-标号[J].數學的實踐與認識,2023,53(4):267-271.