We define the \emph{adjacent vertex distinguishing sum edge coloring problem}. This problem consists in finding an assignment of colors to the edges of a graph with the following constraints: every pair of adjacent edges must have a different color, and every pair of adjacent vertices must not...