Graphs Quiz 1

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

A. n-1

B. n

C. n+1

D. 2n-1

Solution :

A) is correct.

n * (n - 1) / 2 when cyclic. But acyclic graph with the maximum number of edges is actually a spanning tree and therefore, correct answer is n-1 edges.

Thanks for Reading

Placewit grows the best engineers by providing an interactive classroom experience and by helping them develop their skills and get placed in amazing companies.

Learn more at Placewit. Follow us on Instagram and Facebook for daily learning.