Smarandachely Adjacent Vertex Distinguishing Edge Coloring of Some Graphs

A Series of new coloring problems (such as vertex distinguishing edge coloring, vertex distinguishing total coloring, adjacent vertex distinguishing edge coloring, smarandachely adjacent vertex distinguishing edge coloring) arise with the divelopment of computer science and information science. At present, there are relatively few articles on smarandachely adjacent vertex distinguishing edge coloring. This paper was to solve the problem of the smarandachely adjacent vertex distinguishing edge coloring of graph (C2m xCn).