GATE | IT | 2004 | Discrete maths | Graph theory | Question 5

Last Updated :
Discuss
Comments

What is the maximum number of edges in an acyclic undirected graph with n vertices?

n-1

n

n + 1

2n-1

This question is part of this quiz :

Top MCQs on Graph Data Strcuture with Answers,GATE-IT-2004
Tags:
DSA Quiz
GATE
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy