The maximum number of edges in a n-node undirected graph without self loops is
PYQ GATE 2002
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
Attempted by 1555 students.
Sign up free to check your answer
Sign up freeLoading lesson…

