Question

Let G be a graph with n vertices and n+1 edges
​

Answer 1

Answer:

Proof: We know that the minimum number of edges required to make a graph of n vertices connected is (n-1) edges. We can observe that removal of one edge from the graph G will make it disconnected. Thus a connected graph of n vertices and (n-1) edges cannot have a circuit. Hence a graph G is a tree.

PLEASE MARK ME AS BRAINLIST

Answer 2

Answer:

you are sleeping peacefully in peace of the day of the day of the day of the day of