Question

a graph is tree if and only if ​

Answer 1

Answer:

Theorem 4.1 A graph is a tree if and only if there is exactly one path between every pair of its vertices. Proof Let G be a graph and let there be exactly one path between every pair of vertices in G. So G is connected. ... Theorem 4.3 Any connected graph with n vertices and n−1 edges is a treeStep-by-step explanation:

Answer 2

A graph is a tree if and only if "here is exactly one path between every pair of its vertices"

Detailed answer

To find the answer to this we have to find the root of the tree first.

• A tree is a graph that has its vertices are interconnected by one path. usually two vertices.
• Usually, every tree is a graph as the vertex cannot be empty.
• We have to perform the Dfs check that only one parent exists in total and not more than that.
• If there is no node then the value is returned.