Question

a graph with n vertices and n-1 edges that is not a tree is called

Comments

< possibility of cycle >

<disconnected graph>

---

@OP, please correct the category of this question. This question does not fall under CO & Architecture.

Answer 1

If a graph has n vertices and n-1 edges and it is not a tree than its a disconnected graph which contains at least a cycle. 

If it is a connected graph then it must be a tree because here no of edges = n-1.

Comments

I think not forest

a disconnected graph where cycle is present

or a connected graph without cycle

---

if it is connected then it should be a tree.

---

every one who ever has awarded my comment with 3 downvote  ... please give reason where I am wrong ...  

See .. the above question says that a graph with n vertices and n-1 edges that is not a tree. 

and srestha said that  a connected graph without cycle... so I said that if it is connected then it should be tree which should not be ans according to question, because I the question it is mentioned that result of graph is not a tree. 

please comment all respected sir