Tree
# Definition
Suppose $G$ is an Undirected Graph. Then $G$ is a Tree if $G$ is a Connected Graph and for each $u, v \in V(G)$, there exists only one Simple Path from $u$ to $v$.
Search
Suppose $G$ is an Undirected Graph. Then $G$ is a Tree if $G$ is a Connected Graph and for each $u, v \in V(G)$, there exists only one Simple Path from $u$ to $v$.