Skip to content
Related Articles

Related Articles

ISRO | ISRO CS 2016 | Question 3
  • Last Updated : 22 Mar, 2018
GeeksforGeeks - Summer Carnival Banner

The maximum number of edges in a n-node undirected graph without self loops is
(A) n2
(B) n(n-1)/2
(C) n-1
(D) n(n+1)/2


Answer: (B)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :