NIELIT 2017 July Scientist B (IT) - Section B: 1

Question

Given an undirected graph $G$ with $V$ vertices and $E$ edges, the sum of the degrees of all vertices is

• A. $E$
• B. $2E$
• C. $V$
• D. $2V$

Answer 1

Handshaking Theorem

Handshaking Theorem is also known as Handshaking Lemma or Sum of Degree Theorem.

In Graph Theory, Handshaking Theorem states in any given graph, Sum of the degree of all the vertices is twice the number of edges contained in it.