Maximum number of edges in a n - node undirected graph without self loops is
n2
n(n - 1)/2
n - 1
(n + 1) (n)/2
This question is part of this quiz :
