Abhijeet Mulgund's Personal Webpage

Search

Search IconIcon to open search

Tree

Last updated Nov 1, 2022

# 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$.