Let  be the degree of a vertex u in a graph G. The weighted edge labeling is induced by summing the degrees of the end-verticesof the edge. For each edge  the weight  of e is  The weight of a graph G,  is defined by In [2, 4], the value of  of sum(join) and standard products of two graphs are given. In this paper, we establish values of  for direct product, Cartesian product, lexicographic product, strong product, join and corona of three graphs.

edge weight, edge degree weight sum, labeling.