Question

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

Answer 1

The correct option is A n - 1

Acyclic graph are graphs which does not contain cycle.

For maximum number of edges each vertex connect to other vertex only if it does not from a cycle i.e. from a tree with n vertices, which has maximum n - 1 edges. Ex. with 4 vertices, 3 edges maximum.