Definition:Subtree (Graph Theory)

From ProofWiki
Jump to navigation Jump to search

Definition

Let $T = \struct {V, E}$ be a tree.


A subtree of $T$ is a subgraph of $T$ that is also a tree.


Also see

Retrieved from "https://proofwiki.org/w/index.php?title=Definition:Subtree_(Graph_Theory)&oldid=612005"