1 problem

Let $G$ be a simple finite graph with no isolated edge. A neighbour-sum-distinguishing labeling is an edge-labeling such that, for every edge $uv$, the sums of the labels of the ed…