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