ISRO Computer Science (CSE) 2009 - Question 52

All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2009

If G is a graph with e edges and n vertices the sum of the degrees of all vertices in G is

  • A. e
  • B. e/2
  • C. e²
  • D. 2 e

Answer: D. 2 e

Explanation: Handshaking lemma: Sum of degrees = 2 * number of edges.

| | All questions of ISRO Computer Science (CSE) 2009