GATE | CS | 2002 | Discrete Mathematics | Graph Theory | Question 25

Last Updated :

Discuss

Comments

Maximum number of edges in a n - node undirected graph without self loops is

n²

n(n - 1)/2

n - 1

(n + 1) (n)/2

This question is part of this quiz :

Top MCQs on Graph Theory in Mathematics,GATE-CS-2002

Tags:

Engineering Mathematics Questions

Share your thoughts in the comments

author

GeeksforGeeks