Pick up the wrong statement for calculating degree of a node in a graph:

2017

Pick up the wrong statement for calculating degree of a node in a graph:

  1. A.

    For every regular edge on a vertex is counted as 1

  2. B.

    For a self-loop it is counted as 2

  3. C.

    Sum of all the edges on a vertex

  4. D.

    Sum of all the edges in the graph

Attempted by 56 students.

Show answer & explanation

Correct answer: D

The degree of a vertex is counted using edges incident on that vertex. Summing all edges in the entire graph is not how a node's degree is calculated.

Explore the full course: Coding For Placement