Question

Let G be a simple graph with n vertices. Show that G is a tree if and only if G is connected and has (n – 1) edges​

Answer 1

Answer:

Tree:- A connected graph without any circuit is called a Tree. In other words, a tree is an undirected graph G that satisfies any of the following equivalent conditions: Any two vertices in G can be connected by a unique simple path. G is acyclic, and a simple cycle is formed if any edge is added to G.