Consider an undirected graph without selfloops of 6 nodes. The maximum number…

Consider an undirected graph without selfloops of 6 nodes. The maximum number of edges in the graph will be _______.

  1. A.

    10

  2. B.

    15

  3. C.

    20

  4. D.

    23

Attempted by 387 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…