Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

ISRO | ISRO CS 2016 | Question 3

  • Last Updated : 22 Mar, 2018

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)


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

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!