GeeksforGeeks » Interview Questions
Adobe Interview Question for Software Engineer/Developer
(3 posts)-
Prove that in a graph, sum of degrees = twice the number of edges.
given that, also deduce a relation between number of vertices and number of edges.
-
A vertex degree consists of the branches at the vertex, since we need a branch to connect two vertices, when the degrees of each vertex is counted we count each branch (edge) twice. Hence, the sum of degrees of all vertices is twice the sum of edges.
-
I dont think there is any direct relation between vertex and the number of edges in a graph. Could any obody please comment on it??
Reply
You must log in to post.
