Abstract: We studied the D(2)-vertex sum distinguishing edge-coloring problem of the corona graph of a cycle and a simple graphs by using combinatorial nullstellensatz, constructing coloring function and mathematical induction. We obtained  that the bound of D(2)-vertex sum distinguishing edge-coloring of the corona graph of a cycle and a simple graphs was Δ(G)+1, and then we derived that the bound of the corona graph of a path and a simple graphs was Δ(G)+1.

Key words: cycle graph, simple graph, corona graph, D(2)-vertex sum distinguishing edge-coloring, D(2)-vertex sum distinguishing edge
-coloring number