0 votes 0 votes closed as a duplicate of: GATE IT 2004 | Question: 5 The maximum number of edges in an acyclic undirected graph with n vertices A) n - 1 B) n C) n +1 D) 2n -1 DS graph-theory graph-connectivity + – Sankaranarayanan P.N asked Oct 27, 2016 closed Oct 27, 2016 by Kapil Sankaranarayanan P.N 318 views comment Share Follow See all 0 reply Please log in or register to add a comment.