Question
GATE CS NAT 3: A complete undirected graph has 5 vertices. Enter its number of edges.
Select an option. Your answer will be checked instantly.
Correct Answer: 10
Explanation:
n(n−1)/2=10.
Leave a Reply