The Answer to the Question
is below this banner.
Here's the Solution to this Question
To prove : Sum of degrees of the vertices of any graph is equal to twice of number of edges in the graph.
Let be a graph where n represent number of vertices and m represent number of edges
Let be any arbitrary vertex of G
Suppose (degree of V)
then there exist an edge say 'e' incident at v
Let be such that (w is the other end point for edge 'e')
Thus the edge 'e' contributes one to the degree of vertex v and one to the degree of vertex w.
Thus each edge contributes two to the degree of vertices of V.
Hence, the sum of degrees of all the vertices is twice the number of edges.
[Basically the fact we used in this proof is that each edge in a graph has two end , so each edge gives two degrees to the vertices (one for each vertex)of graph]
No edge No degree
One edge 2 Degree