Determine whether the graph is a tree If the graph is not a

Determine whether the graph is a tree. If the graph is not a tree, give the reason why The graph is a tree. The graph is not a tree because it is disconnected. The graph is not a tree because it has one or more circuits.

Solution

The given graph is a tree. Becuase it is connected, it has no cycles and it has n-1 (10) edges where n=11, number of nodes.

Or you can say that it is a tree using that an undirected graph is a tree if any two nodes has exactly one path between them.

Please give your feedback and do give the vote. Thanks.