The weight omega (e) of an edge e = uv of a graph is defined to be the sum
of degrees of the vertices u and v. In 1990 P. Erdos asked the question: Wh
at is the minimum weight of an edge of a graph G having n vertices and m, e
dges? This paper brings a precise answer to the above question of Erdos.