Open In App
Related Articles

ISRO | ISRO CS 2016 | Question 3

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Share
Report issue
Report
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

Last Updated : 22 Mar, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads