Question

a graph G with v vertices,e ediges is connected worh no cycles ,then which of the following statement is true

Answer 1

Step-by-step explanation:

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.

G is connected and has no cycles.

G is connected but would become disconnected if any single edge is removed from G.

G is connected and the 3-vertex complete graph K3 is not a minor of G.

PLZ SUBSCRIBE TO PGK CREATIONS