Distance two labelings of Cartesian products of complete graphs. - Damei Lu; Wensong Lin; Zengmin Song (Ars Comb., 2012)

L(2, 1)-labelings of the edge-path-replacement of a graph. - Damei Lü (J. Comb. Optim., 2013)

L(d, 1)-labelings of the edge-path-replacement of a graph. - Damei Lü; Nianfeng Lin (J. Comb. Optim., 2013)

L(j, k)-labelings of Cartesian products of three complete graphs. - Damei Lv; Wensong Lin (Ars Comb., 2015)

L(2, 1)-labeling of a circular graph. - Dengju Ma; Han Ren; Damei Lv (Ars Comb., 2015)

Nordhaus-Gaddum-type results for path covering and L(2, 1)-labeling numbers. - Damei Lü; Juan Du; Nianfeng Lin; Ke Zhang; Dan Yi (J. Comb. Optim., 2015)

L(2, 1)-labelings of the edge-multiplicity-paths-replacement of a graph. - Damei Lü; Jianping Sun (J. Comb. Optim., 2016)

L(d, 1)-labelings of the edge-multiplicity-path-replacements. - Juan Du; Damei Lv (Ars Comb., 2017)

Distance labelings and (total-)neighbor-distinguishing colorings of the edge-multiplicity-paths-replacements. - Damei Lu (Ars Comb., 2017)

L(2, 1)-Edge-Labelings of the Edge-Path-Replacement of a Graph. - Nianfeng Lin; Damei Lü; Jinhua Wang (Int. J. Found. Comput. Sci., 2018)