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

# Acyclic Undirected graphs

**Harsha_1997**#4

an acyclic graph with maximum number of edges is a tree.the correct answer is n-1 edges.

an acyclic graph with maximum number of edges is a tree.the correct answer is n-1 edges.