11 votes 11 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 asked Jun 10, 2016 edited Dec 8, 2022 by Lakshman Bhaiya go_editor 2.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 12 votes 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 2 Comments See all 2 2 Comments reply neethu_seb commented Dec 26, 2019 reply Follow Share What about star graph. It is even connected but not a tree, having n vertices and n-1 edges. 0 votes 0 votes abhinavmishra88 commented Dec 28, 2019 reply Follow Share why it is not D option? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes 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 3 Comments See all 3 3 Comments reply Arjun commented Jun 10, 2016 reply Follow Share When you are not sure, try an example for such graph problems. 1 votes 1 votes khyati commented Jun 29, 2016 reply Follow Share 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 votes 1 votes Arjun commented Jun 29, 2016 reply Follow Share The question should have included "simple graph". 2 votes 2 votes Please log in or register to add a comment.