14 14 votes A graph with $n$ vertices and $n-1$ edges that is not a tree, is Connected Disconnected Euler A circuit Graph Theory isro2007 graph-theory euler-graph + – go_editor 4.5k views answer comment Share Follow Print See 1 comment 1 1 comment reply Srken commented Oct 10, 2025 reply Follow flag If it was a tree then with n vertices and n-1 edges becomes connected as tree is simple graph with no cycles. And tree can also be called as minimal acyclic graph because with n-1 edges only it will be connected 0 0 replyShare Please log in or register to add a comment.
Best answer 12 12 votes Assuming only simple graphs (no self loops, multiple edges) let n=4. B)Disconnected Anu answered Jun 25, 2016 • selected Jun 26, 2016 by Desert_Warrior Anu comment Share Follow See all 3 Comments 3 3 Comments reply neethu_seb commented Dec 26, 2019 reply Follow flag What about star graph. It is even connected but not a tree, having n vertices and n-1 edges. 0 0 replyShare abhinavmishra88 commented Dec 28, 2019 reply Follow flag why it is not D option? 0 0 replyShare sb_decoder commented Aug 16, 2025 reply Follow flag A star graph is a specific type of tree where one central vertex is connected to all other vertices, and no other connections exist. This structure fits the definition of a tree as a connected, acyclic graph. 0 0 replyShare Please log in or register to add a comment.
1 1 vote B.Disconnected... Pranabesh Ghosh 1 answered Jun 10, 2016 • edited Jun 29, 2016 by Pranabesh Ghosh 1 Pranabesh Ghosh 1 comment Share Follow See all 4 Comments 4 4 Comments reply Arjun commented Jun 10, 2016 reply Follow flag When you are not sure, try an example for such graph problems. 1 1 replyShare khyati commented Jun 29, 2016 reply Follow flag Example can create confusions even. If we try to draw graph with 5 vertices and 4 edges, we can get a connected graph also. So, what is the exact answer? 1 1 replyShare Arjun commented Jun 29, 2016 reply Follow flag The question should have included "simple graph". 2 2 replyShare sb_decoder commented Aug 16, 2025 reply Follow flag With 5 vertices and 4 edges , either you get connected tree or disconnected 0 0 replyShare Please log in or register to add a comment.
