The maximum number of edges in a n-node undirected graph without self loops is
2016
The maximum number of edges in a n-node undirected graph without self loops is
Answer: B. n(n-1)/2 — The maximum number of edges in an undirected graph with n nodes and no self-loops occurs when every pair of distinct vertices is connected. This is calculated…
- A.
n2
- B.
n(n-1)/2
- C.
n-1
- D.
n(n+1)/2
Attempted by 974 students.
Show answer & explanation
Correct answer: B
The maximum number of edges in an undirected graph with n nodes and no self-loops occurs when every pair of distinct vertices is connected. This is calculated by choosing 2 nodes from n, which equals n(n-1)/2.
Loading lesson…