Abstract: By using the discharging method, we  study the local strict neighbor-distinguishing edge coloring problem of sparse graphs, and obtain that if G is a graph with maximum degree at most four and maximum average degree mad(G)<16/5,  then the local strict neighbor-distinguishing index of G is at most 10.

Key words: sparse graph, local strict neighbor-distinguishing edge coloring, maximum average degree, discharging method