Acyclic Undirected graphs


#1

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


#2

n-1 should be the answer


#3

n-1, if n is the number of vertices of acyclic graph


#4

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